On Computable Numbers, with an Application to the Entscheidungsproblem

Proceedings of the London Mathematical Society 42 (1):230-265 (1936)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,140

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.
Computable chaos.John A. Winnie - 1992 - Philosophy of Science 59 (2):263-275.
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.
Computability & Unsolvability.Martin Davis - 1958 - Dover Publications.
The computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
WHAT IS. . . a Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.

Analytics

Added to PP
2010-08-17

Downloads
399 (#28,377)

6 months
77 (#13,468)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
On the proper treatment of connectionism.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):1-23.
Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).

View all 631 citations / Add more citations

References found in this work

No references found.

Add more references