- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Review: Manuel Blum, On the Size of Machines [Book Review]
Journal of Symbolic Logic 37 (1):199-200 (1972)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Manuel Blum. On the size of machines. Information and control, vol. 11 no. 3 , pp. 257–265.H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (1):199-200.
Review: H. B. Enderton, The Unique Existential Quantifier. [REVIEW]Donald A. Martin - 1975 - Journal of Symbolic Logic 40 (4):627-627.
Review: H. B. Enderton, Hierarchies in Recursive Function Theory. [REVIEW]Gustav Hensel - 1966 - Journal of Symbolic Logic 31 (2):262-263.
Review: H. B. Enderton, Harvey Friedman, Approximating the Standard Model of Analysis. [REVIEW]Andrzej Mostowski - 1974 - Journal of Symbolic Logic 39 (3):600-601.
Review: Herbert B. Enderton, A Mathematical Introduction to Logic. [REVIEW]J. R. Shoenfield - 1973 - Journal of Symbolic Logic 38 (2):340-341.
Review: Manuel Blum, Recursive Function Theory and Speed of Computation. [REVIEW]Paul Young - 1972 - Journal of Symbolic Logic 37 (1):199-199.
Review: Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-658.
H. B. Enderton. On provable recursive functions. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 86–88.Hartley Rogers - 1973 - Journal of Symbolic Logic 38 (3):526-527.
Enderton H. B.. The unique existential quantifier. Archiv für mathematische Logik und Grundlagenforschung, vol. 13 , pp. 52–54. [REVIEW]Donald A. Martin - 1975 - Journal of Symbolic Logic 40 (4):627-627.
Review: Michael Arbib, Manuel Blum, Machine Dependence of Degree of Difficulty. [REVIEW]Alan Cobham - 1969 - Journal of Symbolic Logic 34 (3):509-509.
Analytics
Added to PP
2013-11-22
Downloads
3 (#1,729,579)
6 months
9 (#355,374)
2013-11-22
Downloads
3 (#1,729,579)
6 months
9 (#355,374)
Historical graph of downloads
Citations of this work
Berwick and Weinberg on linguistics and computational psychology.Edward P. Stabler - 1984 - Cognition 17 (2):155-179.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
Immunity and Hyperimmunity for Sets of Minimal Indices.Frank Stephan & Jason Teutsch - 2008 - Notre Dame Journal of Formal Logic 49 (2):107-125.
Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse.Gerhard Lischke - 1975 - Mathematical Logic Quarterly 21 (1):159-166.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-zhzfn uwo