On Computable Numbers, with an Application to the Entscheidungsproblem
Turing's 1936 founding paper — the Turing Machine and the undecidability of the halting problem
Tradition: Mathematical logic / computability theory / Cambridge analytic-mathematical philosophy
Turing's 1936 founding paper of computer science — the Turing Machine and the undecidability of the Entscheidungsproblem
Published in the Proceedings of the London Mathematical Society in 1936-37 (Series 2, vol. 42, pp. 230-265, with a correction at pp. 544-546), 'On Computable Numbers, with an Application to the Entscheidungsproblem' is the founding paper of theoretical computer science. Turing — then a 23-year-old Cambridge fellow — introduces the abstract 'a-machine' (later 'Turing Machine'), a finite-state device with a read-write head moving over an infinite tape of symbols. He defines computable real numbers as those whose decimal expansions can be produced by such a machine, proves the existence of a Universal Turing Machine (one machine that can simulate any other machine when given its description as input), demonstrates the undecidability of the halting problem (no machine can decide, for an arbitrary machine M and input I, whether M halts on I), and concludes that Hilbert's Entscheidungsproblem — the question of whether there is a decision procedure for first-order logic — is unsolvable. The paper appeared independently of Alonzo Church's 1936 lambda-calculus proof of the same conclusion (Turing and Church met in Princeton later that year, and Turing's PhD under Church appeared as 'Systems of Logic Based on Ordinals', 1938). Together the Turing-Church results established the Church-Turing thesis: the intuitive concept of effective calculability coincides with the formal concepts of recursion, lambda-definability, and Turing-computability.
Author
Editions cited
- On Computable Numbers, Proceedings of the London Mathematical Society, ser. 2, vol. 42 (1936-37), 230-265; correction at vol. 43 (1937), 544-546
- Reprinted in Martin Davis, ed., The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions (Raven Press, 1965)
- In Turing, Collected Works: Mathematical Logic, ed. R. O. Gandy and C. E. M. Yates (Elsevier, 2001)
- Critical commentary: Charles Petzold, The Annotated Turing (Wiley, 2008); Robin Gandy, 'The Confluence of Ideas in 1936' in The Universal Turing Machine: A Half-Century Survey (Oxford, 1988)
School Embodiments
Founding paper of computability theory and theoretical computer science.
"A number is computable if its decimal can be written down by a machine." (On Computable Numbers, §1)
Foundational paper for the analytic philosophy of computation.
"Every computable function can be computed by a universal machine." (On Computable Numbers, §6)
Naturalistic-mathematical framework.
"The machine is a deliberately abstract idealisation of the activity of a human computer." (On Computable Numbers, §9)
Structural account of computation.
"All computation reduces to the structural manipulation of symbols on tape." (On Computable Numbers, §1)
Mathematical realism about computable functions.
"Computable functions are a definite mathematical class." (On Computable Numbers, §1)
Analytic-philosophical tradition.
Internal Tensions
The founding paper of theoretical computer science and one of the most-cited mathematical papers of the twentieth century. Together with Church's contemporaneous lambda-calculus paper, established the Church-Turing thesis. Turing's wartime cryptanalytic work at Bletchley Park (Enigma, Tunny) used these abstract ideas in practical machine design; modern computer architectures remain Turing-machine-equivalent.
I. Time
1936 (paper read May, published November). Twenty-three-year-old Turing, then fellow of King's College, Cambridge.
Attributes
II. Space
Cambridge / Princeton. Turing's intellectual context was Newman's logic course at Cambridge and the contemporary Princeton group (Church, Kleene, Rosser).
Attributes
III. Matter
Single 36-page mathematical paper. The abstract Turing Machine is the paper's distinctive contribution — a machine of pure mathematical-symbolic operation, with no physical instantiation required.
Attributes
IV. Observer
Early Turing as logician-mathematician. The paper's 'computer' (originally a human following definite rules) is the abstract idealisation that Turing then mechanises.
Attributes
V. Energy
Founding-logical energies of the 1936 'three-miracle' year (Turing, Church, Post all independently characterised effective calculability).
Attributes
VI. Information
The founding paper of theoretical computer science and of the formal theory of information processing. Every digital computer is in principle a Turing machine.
Attributes
Personas that cite this work
Personas with the nearest attribute fingerprint
Historical figures whose own classification on the same six-dimensional grid lands closest to this work's. Computed by attribute-agreement on coordinates both address.
Computed school proximity
The work's attribute fingerprint scored against all schools using the same quiz scorer. Useful as a sanity check on the hand-curated embodiments above.
How On Computable Numbers, with an Application to the Entscheidungsproblem resolves each dilemma
34 resolved positions across 4 dimensions, including 6 distinctive where the majority of schools go the other way · 23 unaligned.
Each dimension is sorted so minority positions come first. Mainstream positions are folded into an expandable list.
Time · 9 dilemmas · 5 distinctive
Persistence, the future, and the direction of becoming.