Computable Numbers: Difference between revisions
From Tardis Wiki, the free Doctor Who reference
No edit summary |
(Adding categories) |
||
| Line 10: | Line 10: | ||
* '''[https://doi.org/10.1112/plms/s2-42.1.230 Full text of the paper]''' | * '''[https://doi.org/10.1112/plms/s2-42.1.230 Full text of the paper]''' | ||
[[Category:Mathematics from the real world]] | [[Category:Mathematics from the real world]] | ||
[[Category:Documents from the real world]] | |||
Revision as of 02:00, 21 December 2018
Computable Numbers was the title of a scientific paper by Alan Turing, where he disproved David Hilbert's thesis that all mathematical problems were solvable.
Turing worked on this paper for over a year and published it before World War II. The proof used the concept of a Universal Machine. (PROSE: The Turing Test)
Behind the scenes
In the real world, the paper was published in 1937 and was titled On Computable Numbers, with an Application to the Entscheidungsproblem.
