- Start
- Nov 12, 193690% CONFIDENCEfrom the source
Turing Submits On Computable Numbers
- Turing submitted "On Computable Numbers, with an Application to the Entscheidungsproblem" on 12 November 1936; it was first published in 1937[2]
- It was the second proof, after Church's theorem, that Hilbert's Entscheidungsproblem has no solution - that some purely mathematical yes-no questions can never be answered by computation[2]
- Turing published "A Correction" in 1938[2]
- The abstract machine the paper defines to make the argument is the model of computation every stored-program computer since has been measured against[1][3]
References 388% CONFIDENCE
The first entry is always the pin's source. Overall confidence is a weighted average of how firmly each reference supports the start and end times used above; a reference counts half as much for every 180 days older than the newest.
- [1]90%cs.virginia.edu/~robins/Turing_Paper_1936.pdfcs.virginia.edu· Posted Sep 22, 2026· Starts Nov 12, 1936 ✓· 33% of score
Wikipedia's[2][3] article on Turing's proof dates the submission without hedging: "Turing's proof is a proof by Alan Turing submitted on 12 November 1936 and first published in 1937 with the title 'On Computable Numbers, with an Application to the Entscheidungsproblem'." The pin is the submission, which is the dated act; the Proceedings of the London Mathematical Society issue carrying it is dated 1937.
- [2]90%Turing's proofen.wikipedia.org· Added Sep 22, 2026· 33% of score
Dates the submission and publication and explains what the paper proves: "the second proof (after Church's theorem) of the negation of Hilbert's Entscheidungsproblem... that some decision problems are 'undecidable'".[1]
- [3]85%Alan Turingen.wikipedia.org· Added Sep 22, 2026· 33% of score
The author's own article, for where he was working in 1936 and what the machine he defined became.[1]
Suggest a correction
Something missing or wrong? Say it in your own words: a link that backs this pin up, a different start or end date and why, or a fact it lacks or gets wrong. The AI checks it against this pin's sources, searches for better ones, and adds any page that backs you up. The pin's own sources still count most.
