Computable Numbers: Difference between revisions

From Tardis Wiki, the free Doctor Who reference
m
Bot: Cosmetic changes
(Adding categories)
m (Bot: Cosmetic changes)
Line 1: Line 1:
{{retitle|''{{PAGENAME}}''}}{{wikipediainfo|Turing's proof}}
{{retitle|''{{PAGENAME}}''}}{{wikipediainfo|Turing's proof}}
'''''{{PAGENAME}}''''' was the title of a scientific paper by [[Alan Turing]], where he disproved [[David Hilbert]]'s thesis that all mathematical problems were solvable.  
'''''{{PAGENAME}}''''' 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 (novel)|The Turing Test]]'')
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 ==
== 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''.
In the real world, the paper was published in 1937 and was titled ''On Computable Numbers, with an Application to the Entscheidungsproblem''.
 
== External links ==
== External links ==
* '''[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]]
[[Category:Documents from the real world]]
Bots, Bureaucrats, emailconfirmed, Administrators
765,429

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.