Computable Numbers: Difference between revisions
From Tardis Wiki, the free Doctor Who reference
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
'''''{{PAGENAME}}''''' was the title of a scientific paper by [[Alan Turing]], where he disproved [[David Hilbert]]'s thesis that all mathematical problems are solvable. | '''''{{PAGENAME}}''''' was the title of a scientific paper by [[Alan Turing]], where he disproved [[David Hilbert]]'s thesis that all mathematical problems are solvable. | ||
Turing worked on this paper for over a year and published it before [[World War II]]. The proof used the concept of a | 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 (novel)|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''. | |||
== External links == | |||
* '''[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]] | ||
Revision as of 00:07, 18 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 are 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.
