On Computable Numbers, with an Application to the Entscheidungsproblem
Proceedings of the London Mathematical Society 42 (1):230-265 (1936)
Abstract
This article has no associated abstract. (fix it)Reprint years
1937
DOI
10.2307/2268810
My notes
Similar books and articles
Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - Journal of Symbolic Logic 71 (2):399 - 424.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
The computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
Analytics
Added to PP
2010-08-17
Downloads
399 (#28,377)
6 months
77 (#13,468)
2010-08-17
Downloads
399 (#28,377)
6 months
77 (#13,468)
Historical graph of downloads
Citations of this work
On the proper treatment of connectionism.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):1-23.
Computation and cognition: Issues in the foundation of cognitive science.Zenon W. Pylyshyn - 1980 - Behavioral and Brain Sciences 3 (1):111-32.
Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).
Quantum Information Theory and the Foundations of Quantum Mechanics.Christopher Gordon Timpson - 2013 - Oxford University Press.