Alan Turing

1912 – 1954 · United Kingdom · Mathematics, Computing, Biology

Defined what a computer is, then was destroyed by the country he saved.

Summary^1,3

Turing's 1936 paper on computable numbers described an abstract machine that could compute anything computable — the logical blueprint of every computer. At Bletchley Park he designed the bombe that broke Enigma. Prosecuted for homosexuality in 1952, chemically castrated, he died at 41.

Achievements^1,4

Defined the universal Turing machine and proved the limits of computation (1936)
Led the Enigma codebreaking effort, credited with shortening WWII by an estimated two years
Proposed the Turing test and effectively founded artificial intelligence as a field (1950)
Wrote the founding paper of mathematical biology on how chemical patterns generate biological form (1952)

Principal works^1,3

On Computable NumbersComputing Machinery and IntelligenceThe Chemical Basis of Morphogenesis

How the work shapes the world today^2,4

Every device with a processor is a physical approximation of his universal machine, and computer science's highest honour is the Turing Award. The Turing test frames public argument about large language models. His reaction–diffusion equations explain animal coat patterns and are used in developmental biology and materials design. He received a royal pardon in 2013 and the resulting 'Turing's Law' pardoned around 49,000 men; he is on the Bank of England £50 note.

Posterity and the family line^2,4

Turing never married — his engagement to Joan Clarke ended when he told her he was gay — and had no children.

2 people · 1 generations · 0 links with primary documentation

Sir John Dermot Turing
Nephew
Historian of Bletchley Park and author of the family's account of his uncle's work and prosecution.
Attested
No direct line
Family
Childless. His posterity is a discipline: computer science, and the roughly 49,000 men pardoned under the law bearing his name.
Attested

Every link carries its own evidence. Documented means a register, will, archive or prize record names the relationship; attested rests on scholarly reference; contested is disputed between sources; and where the record runs out it is marked rather than filled in.

Talks and interviews

Continuity of ideas

Who shaped Alan Turing, and who they shaped

Inherited from3

Ada Lovelace
1815 – 1852 · Computing, Mathematics
Turing answers 'Lady Lovelace's objection' by name in the 1950 Mind paper.
Gottfried Wilhelm Leibniz
1646 – 1716 · Mathematics, Philosophy
The Entscheidungsproblem is Leibniz's dream of a decision procedure, answered in the negative.
Kurt Gödel
1906 – 1978 · Mathematics, Philosophy
Incompleteness is the result Turing recast as the halting problem with a machine model.

Passed the work to3

Claude Shannon
1916 – 2001 · Mathematics, Computing
Bletchley conversations connect computability to Shannon's measure of information.
Grace Hopper
1906 – 1992 · Computing
Stored-program universality is what makes a compiler — code writing code — thinkable.
Konrad Zuse
1910 – 1995 · Computing, Engineering
Zuse's Z3 and Turing's model converge on programmable general computation.

Sources and references

Numbered markers in the text above point to the entries below. Each links to a primary document, archival collection or scholarly reference where the claim about Alan Turing can be checked.