Computable Numbers: Difference between revisions
From Tardis Wiki, the free Doctor Who reference
(Created page with "{{wikipediainfo|Turing's proof}} '''''{{PAGENAME}}''''' was the title of a scientific paper by Alan Turing, where he disproves David Hilbert's thesis that all mathemat...") |
(Adding categories) |
||
| Line 3: | Line 3: | ||
Turing worked on this paper for over a year and published it before [[World War II]]. The proof uses the concept of a [[Universal Machine]]. ([[PROSE]]: ''[[The Turing Test (novel)|The Turing Test]]'') | Turing worked on this paper for over a year and published it before [[World War II]]. The proof uses the concept of a [[Universal Machine]]. ([[PROSE]]: ''[[The Turing Test (novel)|The Turing Test]]'') | ||
[[Category:Mathematics from the real world]] | |||
Revision as of 23:59, 17 December 2018
Computable Numbers was the title of a scientific paper by Alan Turing, where he disproves 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 uses the concept of a Universal Machine. (PROSE: The Turing Test)
