English mathematician and logician who, in a 1936 paper answering Hilbert's Entscheidungsproblem (decision problem), defined an abstract computing machine, now called a Turing machine, and used it to prove that no general algorithm can decide, for every possible mathematical statement, whether it is provable, an early and foundational result of computability theory. During the Second World War he led the team at Bletchley Park that broke the German Enigma cipher, work credited with shortening the war significantly. In 1952 he was prosecuted under British law for homosexual acts, then a crime, and accepted chemical castration in place of prison; he died in 1954 of cyanide poisoning, ruled a suicide, and received a posthumous royal pardon in 2013. This entity carries his mathematics and logic; his broader legacy in computing is also held on the family's Science and Technology atlases.
Facts
BirthplaceMaida Vale, London, England 2 Death PlaceWilmslow, Cheshire, England, of cyanide poisoning, ruled a suicide 2 Nationality / Culture Defining ContributionThe Turing machine (1936) and the proof of the undecidability of the Entscheidungsproblem, founding computability theory; wartime codebreaking of the Enigma cipher at Bletchley Park. 2 Notable WorkOn Computable Numbers, with an Application to the Entscheidungsproblem (1936) 2 Connections
Associated With
Source MacTutor History of Mathematics Archive
Attributed Works
Source Wikipedia: Turing machine
In Branch
Source The Stanford Encyclopedia of Philosophy
Source The Stanford Encyclopedia of Philosophy
Namesake Of
Proofs Credited
Source Entscheidungsproblem (Wikipedia)
Source Turing's proof - Wikipedia
In the Other Atlases
Same As
Also in Science Atlas: the same subject.
Also in Technology and Engineering Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Alan Turing
WikipediaLead section, gender referenceQuote, Lead section, gender reference
He was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer.
2. The Stanford Encyclopedia of Philosophy
Center for the Study of Language and Information, Stanford University
MacTutor History of Mathematics Archive
University of St Andrews, School of Mathematics and StatisticsAssociated With: Algorithm, https://mathshistory.st-andrews.ac.uk/Biographies/Turing/Quote, Associated With: Algorithm, https://mathshistory.st-andrews.ac.uk/Biographies/Turing/
In 1936 he published On Computable Numbers, with an application to the Entscheidungsproblem. It is in this paper that Turing introduced an abstract machine, now called a Turing machine, which moved from one state to another using a precise finite set of rules given by a finite table and depending on a single symbol it read from a tape.
Entscheidungsproblem (Wikipedia)
Proofs Credited: Church's Theorem, Lead section
Such an algorithm was proven to be impossible by Alonzo Church and Alan Turing in 1936.
Proofs Credited: Church's Theorem, Lead
Such an algorithm was proven to be impossible by Alonzo Church and Alan Turing in 1936.
View the SourceTuring's proof - Wikipedia
Proofs Credited: Turing's Proof, LeadQuote, Proofs Credited: Turing's Proof, Lead
Turing's proof is a proof by Alan Turing submitted on 12 November 1936 and first published in 1937 with the title "On Computable Numbers, with an Application to the Entscheidungsproblem".
Wikipedia: Turing machine
Attributed Works: Turing Machine, LeadQuote, Attributed Works: Turing Machine, Lead
The Turing machine was invented in 1936 by Alan Turing, who called it an "a-machine" (automatic machine).
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.