Alan Mathison Turing was a British mathematician, logician, and computer scientist. His 1936 paper "On Computable Numbers" introduced the theoretical device now called the Turing machine, which remains the standard model of computation. During World War II he led the Bletchley Park effort that broke the German Enigma cipher. His 1950 paper "Computing Machinery and Intelligence" proposed the Imitation Game — now called the Turing Test — as an operational definition of machine intelligence.
Turing is the intellectual founder of artificial intelligence as a rigorous field. Every contemporary conversation about machine intelligence traces back to his 1950 paper, which argued that the question "can a machine think?" should be replaced by a testable question about behavioral indistinguishability.
His earlier computability results define what AI systems can possibly do: Turing showed that any effective procedure can be simulated by a Turing machine, and conversely that some questions are uncomputable. Modern deep learning does not exceed the limits of Turing computation — it just explores its practical corners.
Turing's contemporary reputation has been complicated by the posthumous recognition of his wartime work and the belated 2013 royal pardon for his 1952 conviction. The Turing Award (granted annually by the ACM) has become computing's equivalent of the Nobel Prize; Turing himself has become a cultural symbol as much as a scientific figure. In the AI context, the reason to return to the original papers is not reverence but precision: Turing asked the questions the field has still not answered, in forms clearer than most of their contemporary restatements.
Born in London, 1912. PhD from Princeton, 1938. Joined the Government Code and Cypher School at Bletchley Park in 1939; led Hut 8, responsible for German naval Enigma. After the war, designed the ACE computer at the National Physical Laboratory; later worked at Manchester. Prosecuted in 1952 under British laws against homosexuality; died by cyanide poisoning in 1954.
The Turing machine. A simple theoretical device — tape, head, rules — that captures the full power of digital computation.
The halting problem. The proof that no program can decide, for every possible program, whether it halts. A foundational limitation on what computing can do.
The Turing Test. See Turing Test.
Morphogenesis. Late-career work on how biological patterns form — a precursor to reaction-diffusion models and to theoretical biology.
Morphogenesis was the last obsession. Turing's final paper (1952), on how chemical reaction-diffusion systems produce biological patterns, is his least-read but most biologically influential work. It connects directly to contemporary work on pattern formation in neural systems and on the emergence of macroscopic structure from microscopic rules — a theme that recurs in deep learning as well.