Content deleted Content added
m Reverting possible vandalism by 132.72.45.162 to version by Malleus Fatuorum. False positive? Report it. Thanks, ClueBot. (531989) (Bot) |
|||
Line 39:
==University and work on computability==
In his momentous paper "On Computable Numbers, with an Application to the ''[[Entscheidungsproblem]]''"<ref>{{ Cite news | last= Turing | first= A.M. | publication-date = 1937 | year = 1936 | title = On Computable Numbers, with an Application to the Entscheidungsproblem | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 42 | pages = 230–65 | doi= 10.1112/plms/s2-42.1.230 | url = http://www.comlab.ox.ac.uk/activities/ieg/e-library/sources/tp2-ie.pdf}} (and {{Cite news | last = Turing | first = A.M. | publication-date = 1937 | title = On Computable Numbers, with an Application to the Entscheidungsproblem: A correction | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 43 | pages = 544–6 | doi = 10.1112/plms/s2-43.6.544 | year = 1938 }})</ref> (submitted on 28 May 1936), Turing reformulated [[Kurt Gödel]]'s 1931 results on the limits of proof and computation, replacing Gödel's universal arithmetic-based formal language with what are now called [[Turing machine]]s, formal and simple devices. He proved that some such machine would be capable of performing any conceivable mathematical computation if it were representable as an [[algorithm]].
| |||