---
id: BIO-TURING-001
title: "Alan Turing"
alternative_names:
  - "Alan Mathison Turing"
category: "People & Organizations → Founders of Computing and AI"
volume: X
chapter: 55
entry_type: "Biography"
level: 3
status: "Draft"
last_reviewed: 2026-10-15
version: "0.1.0"
prerequisites:
  - "HIST-001"
related_entries:
  - "HIST-002"
  - "FOUND-001"
  - "FOUND-005"
  - "BIO-SHANNON-001"
  - "BIO-MCCARTHY-001"
---

# Alan Turing

## 1. Concise Definition
Alan Mathison Turing (23 June 1912 – 7 June 1954) was a British mathematician and logician who defined a formal model of computation (the Turing machine), contributed to wartime cryptanalysis at Bletchley Park, worked on early stored-program computers, and posed the question of machine intelligence in the 1950 paper "Computing Machinery and Intelligence".

## 2. Overview & Significance
Turing's 1936–37 paper on computable numbers supplied the definition of effective computation on which computer science and the theory of computability rest. His 1950 paper reframed the question "Can machines think?" as an operational test, the "imitation game", and anticipated several objections that still structure debate about machine intelligence. This entry treats only documented professional contributions; for the intellectual context see [HIST-001] and for the philosophical debate see [FOUND-005].

## 3. Historical Development
Turing was born in Maida Vale, London. He was elected a Fellow of King's College, Cambridge, in 1935 and was awarded the Smith's Prize in 1936 (Wikipedia contributors, 2026a). His paper "On Computable Numbers, with an Application to the Entscheidungsproblem" appeared in the *Proceedings of the London Mathematical Society* in the volume covering 1936–37 (Turing, 1937). He completed a PhD at Princeton in 1938 with a thesis on systems of logic based on ordinals (Wikipedia contributors, 2026a).

During the Second World War he worked for the Government Code and Cypher School at Bletchley Park, where he headed Hut 8, which worked on German naval Enigma traffic; he was appointed OBE in 1946 for wartime services (Wikipedia contributors, 2026a). After the war he worked on the Automatic Computing Engine at the National Physical Laboratory, and from 1948 was a Reader in mathematics at the University of Manchester, where he was deputy director of the Computing Machine Laboratory and consulted on the Ferranti Mark 1 (Wikipedia contributors, 2026a). He published "Computing Machinery and Intelligence" in *Mind* in 1950 (Turing, 1950) and "The Chemical Basis of Morphogenesis" in 1952 (Turing, 1952).

In 1952 he was convicted of gross indecency under the law then in force in Britain. He died on 7 June 1954 at Wilmslow, Cheshire, aged 41; the inquest recorded a verdict of suicide by cyanide poisoning (Wikipedia contributors, 2026a). A formal government apology followed a public campaign in 2009, and a royal pardon was granted in 2013 (Wikipedia contributors, 2026a). [VERIFICATION NEEDED: these biographical dates, posts and honours were taken from a secondary encyclopedic source; primary institutional pages were not retrievable in this session.]

## 4. Technical / Conceptual Explanation (Principal Contributions)
**Computability.** Turing described an abstract machine that reads and writes symbols on an unbounded tape according to a finite table of rules. He argued that such machines capture what a human computer following a mechanical procedure can do, constructed a *universal* machine able to simulate any other such machine given its description, and used the construction to show that the *Entscheidungsproblem* (the decision problem for first-order logic) has no general algorithmic solution (Turing, 1937). Church independently reached a negative answer by a different formalism; the equivalence of the formalisms underlies the Church–Turing thesis, which is a thesis about the informal notion of computation, not a theorem.

**The imitation game.** In 1950 Turing proposed replacing "Can machines think?" with a game in which an interrogator communicates by text with a human and a machine and tries to identify which is which (Turing, 1950). The paper considers nine objections, including the theological objection, the "heads in the sand" objection, the argument from consciousness, and Lady Lovelace's objection, and suggests that a machine might be built by simulating a child's mind and educating it. The paper proposes a criterion of behavioural indistinguishability; it does not claim that passing such a test settles whether a machine understands or is conscious, and that inference remains disputed (see [FOUND-005]).

**Morphogenesis.** Turing (1952) proposed that reaction–diffusion equations could account for the emergence of patterns in biological development. This is outside AI but is part of his documented scientific record.

## 5. Collaborators and Schools of Thought
Turing's logical work engaged the programme of Hilbert and the results of Gödel and Church. At Bletchley Park his work was collective and the historical record credits many individuals. His 1950 paper stands at the boundary between logic, early computing and cybernetics; for the relation of these traditions to the 1956 Dartmouth workshop see [HIST-002] and Kline (2011).

## 6. Recognition and Institutional Legacy
The A.M. Turing Award of the Association for Computing Machinery is named in his honour and is treated in several other biographies in this volume ([BIO-MCCARTHY-001], [BIO-MINSKY-001], [BIO-NEWELLSIMON-001], [BIO-HINTON-001], [BIO-SUTTON-001]). The "Turing test" is a standard name for the imitation game, although Turing's paper does not use that term.

## 7. Limitations, Misreadings and Open Questions
Common misstatements include treating the 1950 paper as a prediction schedule, treating the imitation game as an engineering benchmark, and equating the Turing machine with a specific design of physical computer. Turing made a conditional prediction about the performance of machines at the imitation game by about the year 2000; it concerns a particular statistical criterion and should be read in the paper itself (Turing, 1950). Whether behavioural indistinguishability is sufficient evidence of thought is contested (Contested).

## 8. Current State of Knowledge
The Turing machine model and the undecidability of the halting problem and the *Entscheidungsproblem* are standard results in computability theory (Established). The imitation game remains a reference point in discussions of large language models, though the evidential value of conversational indistinguishability is disputed, and contemporary evaluation practice is covered in [CAP-BENCH-001].

## 9. Future Trajectory & Strategic Outlook
No forecasts are made in this biography. The historiography of Turing's life and work continues to develop as archival material is catalogued; readers should check current scholarship for later biographical findings.

## 10. Related Entries & Knowledge Graph
- **Foundational Concepts**:
  - [[HIST-001] Precursors to Artificial Intelligence](../vol02_history/HIST-001_precursors_to_ai.md): Context for computability and cybernetics.
  - [[FOUND-001] Artificial Intelligence](../vol01_foundations/FOUND-001_artificial_intelligence.md): The discipline that took up Turing's question.
- **Related Methods & Technologies**:
  - [[FOUND-005] Philosophy of Mind](../vol01_foundations/FOUND-005_philosophy_of_mind.md): Debate over what the imitation game does and does not show.
  - [[HIST-002] The Dartmouth Workshop (1956)](../vol02_history/HIST-002_dartmouth_workshop.md): The field-founding event two years after Turing's death.
- **Advanced Implications & Future Trajectories**:
  - [[BIO-SHANNON-001] Claude Shannon](./BIO-SHANNON-001_claude_shannon.md): Contemporary working on information and machine play.
  - [[BIO-MCCARTHY-001] John McCarthy](./BIO-MCCARTHY-001_john_mccarthy.md): Organizer of the Dartmouth proposal.

## 11. References & Foundational Literature
1. Turing, A. M. (1937). *On Computable Numbers, with an Application to the Entscheidungsproblem*. Proceedings of the London Mathematical Society, s2-42(1), 230–265 (volume covers 1936–37). https://doi.org/10.1112/plms/s2-42.1.230. [Defines the Turing machine and the universal machine and shows the Entscheidungsproblem is unsolvable.]
2. Turing, A. M. (1950). *Computing Machinery and Intelligence*. Mind, 59(236), 433–460. https://doi.org/10.1093/mind/LIX.236.433. [Proposes the imitation game and discusses objections.]
3. Turing, A. M. (1952). *The Chemical Basis of Morphogenesis*. Philosophical Transactions of the Royal Society of London B, 237(641), 37–72. https://doi.org/10.1098/rstb.1952.0012. [Reaction–diffusion account of biological pattern formation.]
4. Kline, R. R. (2011). *Cybernetics, Automata Studies, and the Dartmouth Conference on Artificial Intelligence*. IEEE Annals of the History of Computing, 33(4), 5–16. https://doi.org/10.1109/MAHC.2010.44. [Historical context relating cybernetics, automata theory and the founding of AI.]
5. Wikipedia contributors. (2026a). *Alan Turing*. Wikipedia. https://en.wikipedia.org/wiki/Alan_Turing (accessed 2026-10-15). [Secondary source for dates, posts, honours, conviction, inquest and pardon.]

## 12. Evidential Classification Matrix
| Section / Claim | Evidence Category | Supporting Source | Confidence / Status |
| :--- | :--- | :--- | :--- |
| Turing machine, universal machine, undecidability of the Entscheidungsproblem | Established | Turing (1937) | High |
| Content of the 1950 imitation-game proposal | Established (primary text) | Turing (1950) | High |
| Birth/death dates, posts, OBE, conviction, pardon | Well Supported (secondary source only) | Wikipedia contributors (2026a) | Moderate; primary pages not retrieved |
| Whether imitation-game success shows thought | Contested | Turing (1950); see FOUND-005 | Open debate |

## 13. Revision History
- **v0.1.0** (2026-10-15): Initial draft. Citations checked against arXiv/Crossref/publisher pages where marked; not independently fact-checked.