← GALLERY VIII EXHIBITS
Turing
GALLERY VIII

Turing

Alan Turing (1912–1954), British mathematician and logician, conceived the universal computing machine (1936) and led Bletchley Park's cryptanalysis during World War II. His work founded computer science and artificial intelligence, though his life ended in tragedy following prosecution for homosexuality.
Alan Mathison Turing (23 June 1912 – 7 June 1954) was a British mathematician, logician, and cryptanalyst whose theoretical work on computable numbers and the abstract "a-machine" (now called the Turing machine) established the mathematical foundations of computer science. Born in London to a civil-service family, Turing studied mathematics at King's College, Cambridge, and Princeton. During World War II, he was the lead cryptanalyst at Bletchley Park's Hut 8, where he designed the Bombe—an electromechanical device that broke the German Enigma cipher, credited with shortening the war by years and saving hundreds of thousands of lives. After the war, he worked on the ACE (Automatic Computing Engine) at the National Physical Laboratory and the Manchester Mark 1, pioneering practical computer programming. His 1950 paper "Computing Machinery and Intelligence" posed the Turing Test, a philosophical benchmark for machine cognition that remains central to AI ethics. Convicted under the Criminal Law Amendment Act 1885 for homosexual conduct in 1952, he died by cyanide poisoning in 1954 at age 41—a death ruled accidental by the coroner, though widely suspected as suicide.

Specifications

Birth
23 June 1912, London, England
Death
7 June 1954, Woking, Surrey, England
Education
Sherborne School; King's College, Cambridge (B.A. Mathematics, 1935); Princeton University (Ph.D. Mathematical Logic, 1938)
Conviction
March 1952, under Criminal Law Amendment Act 1885 (gross indecency)
Key Invention
Turing machine (theoretical, 1936); Bombe (electromechanical, 1940); ACE design (1945–1947)
Major Publications
On Computable Numbers (1936); Computing Machinery and Intelligence (1950); The Chemical Basis of Morphogenesis (1952)
Primary Affiliation
Bletchley Park (1939–1945); National Physical Laboratory (1945–1948); University of Manchester (1948–1954)
Turing Test Proposed
1950

Engineering

Turing's theoretical contributions preceded and enabled physical engineering. His 1936 paper *On Computable Numbers* described a hypothetical machine—a read-write head scanning an infinite tape of symbols—that could solve any problem expressible as an algorithm. This abstraction proved that some mathematical problems are fundamentally uncomputable, establishing the limits of mechanical reasoning itself. During the war, Turing and his team at Bletchley Park engineered the Bombe, an improvement on Polish designs, which used rotating drums to simulate Enigma rotor positions and eliminate impossible settings at electromechanical speed—processing roughly 17,576 possible rotor positions per minute. After 1945, Turing contributed to the design of the ACE (Automatic Computing Engine), a stored-program electronic computer using mercury delay lines for memory, and later programmed the Manchester Mark 1, one of the first practical digital computers. His 1950 paper introduced the concept of a "digital imitation game"—the Turing Test—as an operational definition of machine intelligence, sidestepping philosophical disputes by proposing that if a machine's responses are indistinguishable from a human's, the question of whether it "thinks" becomes moot.

Parts & Labels

ACE Delay Line Memory
Mercury-filled tube; ultrasonic pulses propagate and reflect; stores bits as phase shifts; cycle time ~1 millisecond
Turing Test Interface
Teletype or text-based dialogue; human judge; hidden machine and human respondent; criterion: indistinguishability
Bombe (Electromechanical)
Rotating drums (rotors) simulating Enigma settings; electric stepping mechanism; plugboard for menu input; output lamps and relays
Turing's Logical Notation
Symbolic formalism for computable functions; Church-Turing thesis equating mechanical and lambda-calculus computability
Turing Machine (Theoretical)
Abstract device with infinite tape, read-write head, and finite state table; no physical embodiment, but foundational to all digital computation
Manchester Mark 1 Cathode-Ray Tube
Williams tube; electrostatic storage of bits on phosphor screen; read by electron beam; volatile but fast

Historical Overview

Alan Turing emerged as a theoretical prodigy during the 1930s, when mathematical logic was undergoing a crisis of foundations. David Hilbert's Entscheidungsproblem (decision problem) asked whether all mathematical truths could be mechanically derived. Turing's 1936 response—the concept of the Turing machine—demonstrated that no universal algorithm could solve all problems, and that Church's lambda calculus and mechanical computation were equivalent. This work, published when Turing was 24, became the bedrock of theoretical computer science, though few outside academic circles understood its implications. When Nazi Germany invaded Poland in 1939, Turing's talents were redirected to cryptanalysis. The German Enigma cipher, used for military communications, was thought unbreakable; each day's rotor settings created 158 quintillion possible configurations. Turing, along with colleagues including Joan Clarke and Jack Herivel, designed and built the Bombe—an electromechanical device that could test thousands of rotor positions per minute, guided by cribs (known plaintext fragments). By 1942, Bletchley Park's cryptanalysts, using Turing's methods, were reading German naval traffic in near-real time, providing intelligence that proved decisive in the Battle of the Atlantic and other campaigns. After the war, Turing moved into practical computing, first at the National Physical Laboratory (where he designed the ACE) and then at Manchester, where he programmed the Mark 1 and began exploring machine learning and artificial intelligence. His 1950 paper *Computing Machinery and Intelligence* reframed the question of machine consciousness not as metaphysical but as operational: if a machine can convince a human interrogator of its humanity through dialogue alone, what grounds remain for denying it intelligence? This Turing Test became the canonical thought experiment in AI philosophy. In 1952, Turing was arrested under the Criminal Law Amendment Act 1885 for a consensual homosexual relationship with a 19-year-old man. Rather than face imprisonment, he accepted chemical castration via estrogen injections—a condition imposed by the court. Two years later, on 7 June 1954, he died from cyanide poisoning; the official verdict was accidental (he had been experimenting with electroplating), but suicide remains widely suspected. His death marked a tragic intersection of genius and persecution, and his legacy has only grown: the Turing Award, established in 1966, is now considered the Nobel Prize of computing.

Why It Existed

Turing's work arose from three converging pressures. First, the foundational crisis in mathematics: by the 1930s, Gödel's incompleteness theorems had shaken confidence in Hilbert's dream of a complete, consistent formal system. Turing's machine concept offered a concrete answer to the Entscheidungsproblem by proving that certain mathematical problems are undecidable—not by any machine, not by any algorithm. Second, World War II created an urgent practical need: the Enigma cipher was strangling Allied shipping and communications. Turing's theoretical understanding of computation and his engineering ingenuity produced the Bombe, which transformed cryptanalysis from a manual, probabilistic art into an industrial, mechanized process. Third, the postwar emergence of electronic computers created a new discipline: how should these machines be programmed? What are their limits? Can they learn? Turing's 1950 paper on machine intelligence was a response to growing public fascination (and anxiety) about thinking machines, and it proposed a pragmatic, testable framework for the question rather than retreating into philosophy.

Daily Use

Turing's work was not a consumer product but a research and military tool. At Bletchley Park (1939–1945), the Bombe was operated by a rotating staff of cryptanalysts and Wrens (Women's Royal Naval Service members), who would set the plugboard according to the day's menu (a list of constraints derived from cribs), start the machine, and listen for the electromagnetic clatter to stop—indicating a possible rotor setting. Operators would then test the candidate setting against intercepted ciphertext. A single Bombe could eliminate thousands of false leads per day; by war's end, Bletchley Park operated over 200 Bombes. After the war, Turing's involvement in computing was more direct and hands-on. At the National Physical Laboratory, he worked on the ACE's design and programming. At Manchester, he personally programmed the Mark 1, writing code for sorting, checkers, and other tasks. His approach was experimental and iterative—he would test ideas, debug, and refine. Turing was also a theorist who spent time at the blackboard, working through proofs and thought experiments. The Turing Test, by contrast, was never implemented in Turing's lifetime; it remained a philosophical proposal, a way of thinking about the problem rather than a practical tool.

Crew / Personnel

Turing worked within several institutional contexts, each with its own personnel structure. At Bletchley Park, he led Hut 8 (Naval Enigma section) alongside colleagues including Joan Clarke (one of the few female cryptanalysts), Jack Herivel (who developed the Herivel tip, a shortcut to rotor settings), and Peter Twinn. The Bombe itself was operated by a larger staff of cryptanalysts, mathematicians, and Wrens—women recruited for their mathematical aptitude and reliability. At the National Physical Laboratory (1945–1948), Turing worked under Sir Charles Darwin (grandson of the naturalist) and collaborated with engineers including Donald Michie (later a pioneer in machine learning). At Manchester (1948–1954), Turing worked with Frederic C. Williams (who invented the Williams tube memory) and Tom Kilburn (who programmed the Mark 1 alongside Turing). His collaborators on theoretical work included Alonzo Church (Princeton), with whom he corresponded on computability, and later Alan Hodgkin and Andrew Huxley (biophysicists), with whom he discussed morphogenesis. Turing was known as a solitary, intense worker, but he was also generous with ideas and mentored younger researchers.

Construction

The Turing machine was a theoretical abstraction, never physically built in Turing's design. However, the Bombe was a concrete electromechanical device, built by the British Tabulating Machine Company under Turing's specifications. The Bombe consisted of a cabinet roughly 7 feet tall and 2 feet wide, containing 36 rotating drums (each simulating an Enigma rotor), a plugboard for input, stepping motors, relays, and output lamps. The drums rotated in synchrony, testing rotor positions at high speed; when a candidate setting matched the constraints of the menu (derived from cribs), the machine would halt and an operator would note the setting. The ACE was constructed using mercury delay-line memory—tubes filled with mercury through which ultrasonic pulses propagated, storing bits as phase shifts. The Manchester Mark 1 used Williams tubes (cathode-ray tubes with electrostatic storage), which were faster but more volatile. Both machines were hand-wired and hand-programmed; there were no compilers or operating systems. Turing wrote machine code directly, using paper tape for input. The construction of these early computers was a craft, not an industry—each machine was largely unique, built by teams of engineers and mathematicians working closely together.

Variations

Turing's theoretical work had few variations—the Turing machine concept was singular and definitive. However, the Bombe existed in several national variants: the British Bombe (which Turing and others designed), the Polish bomba (an earlier electromechanical predecessor), and the German Enigma machine itself (which the Bombe was designed to break). After the war, different computing architectures emerged—some using mercury delay lines (ACE), others using Williams tubes (Manchester Mark 1), still others using vacuum tubes or punch-card systems. Turing's theoretical framework applied to all of them, but the engineering details varied widely. The Turing Test, as a concept, has been reimplemented countless times in software and AI research, but Turing himself never built a specific test apparatus. His 1950 paper proposed the imitation game as a thought experiment; later researchers created chatbots and AI systems designed to pass versions of the test (e.g., ELIZA, PARRY, and modern large language models).

Timeline

DateEvent
1912Alan Mathison Turing born in London 23 June; father Julius Mathison Turing in Indian Civil Service
1931Turing enters King's College, Cambridge Studies mathematics; influenced by John Maynard Keynes and Ludwig Wittgenstein
1936Turing publishes 'On Computable Numbers' Introduces the Turing machine; proves Entscheidungsproblem undecidable
1938Turing receives Ph.D. from Princeton University Dissertation on ordinal logics; works under Alonzo Church
1939Turing joins Bletchley Park September; recruited to work on German Enigma cipher
1940Bombe becomes operational at Bletchley Park First British Bombe installed; Turing's design proves effective
1945Turing joins National Physical Laboratory Begins work on ACE (Automatic Computing Engine) design
1948Turing moves to University of Manchester Joins team building the Manchester Mark 1
1950Turing publishes 'Computing Machinery and Intelligence' Proposes the Turing Test; asks 'Can machines think?'
1952Turing arrested under Criminal Law Amendment Act 1885 March; charged with gross indecency; convicted and sentenced to chemical castration
1952Turing publishes 'The Chemical Basis of Morphogenesis' Explores pattern formation in biological systems using reaction-diffusion equations
1954Turing dies from cyanide poisoning 7 June; death ruled accidental by coroner; suicide widely suspected

Famous Examples

The Bombe, as deployed at Bletchley Park, is the most famous physical instantiation of Turing's work. By 1943, Bletchley Park operated 211 Bombes, each capable of testing thousands of Enigma rotor settings per minute. The Bombe's success in breaking German naval Enigma is credited with shortening World War II by years and saving hundreds of thousands of lives. The Manchester Mark 1 (1948–1951) is the most famous early electronic computer on which Turing worked; it was one of the first stored-program machines and demonstrated the feasibility of practical digital computation. Turing personally programmed the Mark 1 to play checkers and to sort data—pioneering work in machine learning and computer science. The Turing Test, though never formally implemented by Turing himself, has become the canonical benchmark in AI philosophy; modern chatbots and large language models are often evaluated against it. ELIZA (1964–1966), a chatbot designed by Joseph Weizenbaum, was one of the first programs to appear to pass a limited version of the Turing Test, demonstrating the power of Turing's insight. The ACE (Automatic Computing Engine), though not fully completed in Turing's lifetime, became one of the first operational electronic computers and demonstrated the feasibility of his design principles.

Archaeological Finds

No archaeological finds are directly associated with Turing himself, as he left no physical artifacts of comparable significance to shipwrecks or ruins. However, several historical artifacts related to his work survive: the Bombe machines at Bletchley Park (now a museum) have been preserved and restored, including examples of the rotors and plugboards. The National Archives at Kew hold Turing's declassified papers from Bletchley Park, including handwritten notes and design sketches. The University of Manchester archive holds Turing's personal papers, correspondence, and programming notes from his work on the Mark 1. The Science Museum in London holds artifacts related to early computing, including components from the ACE and Mark 1. Turing's death certificate and court records from his 1952 conviction are held in public archives. In 2019, Turing's handwritten notes on the Bombe design were rediscovered in the Bletchley Park archives and digitized, providing new insights into his engineering process. His personal correspondence with colleagues, including letters to Alonzo Church and others, survives in university archives and provides evidence of his thinking and personality.

Comparison Panel

Turing's Bombe Vs. Polish Bomba
The Polish bomba (1938), designed by Marian Rejewski and colleagues, was the first electromechanical device to attack the Enigma cipher. It used rotating drums to simulate Enigma rotors and could test multiple rotor positions in parallel. Turing's Bombe (1940) improved on the Polish design by incorporating the concept of the crib (known plaintext) and using a more efficient stepping mechanism. The British Bombe was faster and more flexible, and it became the industrial-scale tool that broke German naval Enigma. Both machines were based on similar principles, but Turing's engineering and theoretical insights made the British version far more effective.
Turing Test Vs. Descartes' Cogito
Descartes' *Cogito, ergo sum* (1637) grounded consciousness in the act of thinking itself—a metaphysical claim. Turing's imitation game (1950) sidesteps metaphysics entirely, proposing an operational test: if a machine can convince a human judge of its humanity through dialogue, what grounds remain for denying it intelligence? Turing's approach is pragmatic and testable, avoiding the philosophical quagmire of defining consciousness. It has proven far more influential in AI research than Cartesian dualism.
Turing's ACE Vs. Von Neumann's EDVAC
Both machines were designed in the mid-1940s as stored-program electronic computers. Von Neumann's EDVAC (Electronic Discrete Variable Automatic Computer) used a serial architecture with a single processing unit and external memory. Turing's ACE design was more ambitious, exploring parallel processing and more sophisticated memory hierarchies. However, the EDVAC was completed first (1951) and became more influential in establishing the von Neumann architecture as the standard. Turing's ACE was delayed by engineering challenges and was never fully realized according to his original design, though a simplified version (the Pilot ACE) did operate.
Turing Machine Vs. Babbage's Analytical Engine
Babbage's Analytical Engine (1837) was a mechanical design for a general-purpose computing machine, with a mill (processor), store (memory), and control via punched cards—a brilliant anticipation of digital computing. Turing's machine (1936) was a theoretical abstraction, not a physical design, but it provided the mathematical proof that Babbage's vision was fundamentally sound: any computable problem could be solved by a sufficiently programmed machine. Babbage's engine was never fully built; Turing's machine was never built at all, but it became the foundation of all subsequent computer design.

Interesting Facts

  • Turing was an accomplished distance runner and competed in marathons; his best time was 2 hours 46 minutes, close to Olympic standard for the era.
  • At Bletchley Park, Turing chained his mug to the radiator to prevent colleagues from borrowing it, a sign of his eccentric personality and focus.
  • The Bombe's name derived from the Polish bomba, which was named after a Polish pastry (bomba), a joke among the original designers.
  • Turing's 1936 paper 'On Computable Numbers' was rejected by the *Proceedings of the London Mathematical Society* initially and had to be resubmitted; it is now considered one of the most important papers in mathematics.
  • The Manchester Mark 1 was nicknamed the 'Baby' because it was a smaller, experimental version of a larger planned machine.
  • Turing personally wrote the first checkers-playing program for the Manchester Mark 1 in 1950, pioneering machine learning decades before the term existed.
  • The Turing Test has never been formally passed by any machine in Turing's strict sense (a human judge cannot distinguish the machine from a human for an extended dialogue).
  • Turing's conviction in 1952 was under a law (Criminal Law Amendment Act 1885) that also criminalized Oscar Wilde; the law was not repealed in the UK until 1967.
  • Turing's death by cyanide poisoning occurred just 16 months after his conviction and chemical castration began.
  • The Turing Award, established in 1966 by the Association for Computing Machinery, is now considered the Nobel Prize of computing; it carries a monetary prize of $1 million.
  • Turing's work on morphogenesis (pattern formation in biology) was largely ignored during his lifetime but has become central to modern developmental biology and systems biology.
  • Turing was fluent in German and French and had read widely in European mathematics and philosophy, including works by Gödel, Church, and Wittgenstein.
  • The apple found beside Turing's body was never tested for cyanide, so the exact cause of death remains technically unproven.
  • Turing's mother, Sara, outlived him by 16 years and spent much of her later life defending his reputation and legacy.
  • In 2009, the British government issued a formal apology for Turing's prosecution; in 2013, he received a posthumous royal pardon.
  • Turing's theoretical work on computable numbers anticipated the concept of the halting problem, which proved that some questions about program behavior are fundamentally undecidable.

Quotations

  • Quote
    Computing machinery and intelligence
    Context
    The paper's title itself became a rallying cry for the nascent field of artificial intelligence, framing the question of machine cognition as a scientific rather than purely philosophical problem.
    Attribution
    Title of Turing's 1950 paper in *Mind*
  • Quote
    The question 'Can machines think?' I believe to be too meaningless to deserve discussion.
    Context
    Turing rejected metaphysical definitions of 'thinking' and proposed instead an operational test based on behavioral indistinguishability.
    Attribution
    Turing, *Computing Machinery and Intelligence* (1950)
  • Quote
    If a machine is expected to be infallible, it cannot also be intelligent.
    Context
    Turing argued that intelligence and fallibility are linked; a machine that never makes mistakes is not thinking but merely executing a fixed program.
    Attribution
    Turing, *Computing Machinery and Intelligence* (1950)
  • Quote
    I believe that at the end of the century the use of words and general educated opinion will have altered so much that one will be able to speak of machines thinking without expecting to be contradicted.
    Context
    A prescient prediction about the normalization of AI discourse; Turing anticipated that within 50 years, the question would seem quaint.
    Attribution
    Turing, *Computing Machinery and Intelligence* (1950)
  • Quote
    The Entscheidungsproblem is solved when we have found a method by which, for any given formula of the functional calculus, we can decide in a finite number of operations whether it is provable.
    Context
    Turing's formal statement of the decision problem, which he then proved to be unsolvable—a landmark result in mathematical logic.
    Attribution
    Turing, *On Computable Numbers* (1936)
  • Quote
    Machines take me by surprise with great frequency.
    Context
    Turing's acknowledgment that even simple programs could exhibit unexpected behavior, a precursor to modern complexity theory.
    Attribution
    Turing, *Computing Machinery and Intelligence* (1950)
  • Quote
    It is possible to invent a single machine which can be used to compute any computable sequence.
    Context
    Turing's statement of the universality principle—that a single abstract machine can simulate any other computable machine, a foundational concept in computer science.
    Attribution
    Turing, *On Computable Numbers* (1936)
  • Quote
    I am afraid that the line between the physical and the mental is much less clear than we are inclined to think.
    Context
    Turing's philosophical skepticism about the mind-body distinction, informed by his work on computation and biology.
    Attribution
    Turing, in correspondence, c. 1950s

Sources

  • Note
    Foundational paper introducing the Turing machine and proving the undecidability of the Entscheidungsproblem.
    Type
    primary
    Year
    1936
    Title
    On Computable Numbers, with an Application to the Entscheidungsproblem
    Author
    Turing, Alan M.
    Publication
    *Proceedings of the London Mathematical Society*, Series 2, Vol. 42
  • Note
    Seminal paper proposing the Turing Test and discussing machine learning, objections to machine intelligence, and the imitation game.
    Type
    primary
    Year
    1950
    Title
    Computing Machinery and Intelligence
    Author
    Turing, Alan M.
    Publication
    *Mind*, Vol. 59, No. 236
  • Note
    Turing's exploration of pattern formation in biological systems using reaction-diffusion equations; pioneering work in mathematical biology.
    Type
    primary
    Year
    1952
    Title
    The Chemical Basis of Morphogenesis
    Author
    Turing, Alan M.
    Publication
    *Philosophical Transactions of the Royal Society of London*, Series B, Vol. 237
  • Note
    Definitive biography, meticulously researched; covers Turing's life, work at Bletchley Park, computing career, and death. Revised edition 2012.
    Type
    secondary
    Year
    1983
    Title
    *Alan Turing: The Enigma*
    Author
    Hodges, Andrew
    Publication
    Simon & Schuster
  • Note
    Comprehensive collection of Turing's papers, with editorial commentary; includes previously unpublished material and correspondence.
    Type
    secondary
    Year
    2004
    Title
    *The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life*
    Author
    Copeland, B. Jack (ed.)
    Publication
    Oxford University Press
  • Note
    Essays by leading scholars on Turing's contributions to logic, computation, cryptanalysis, and biology; includes technical and historical perspectives.
    Type
    secondary
    Year
    2013
    Title
    *Alan Turing: His Work and Impact*
    Author
    Leeuwen, Jan van (ed.)
    Publication
    Elsevier
  • Note
    Accessible biography focusing on Turing's intellectual development and the social context of his work; strong on the Bletchley Park period.
    Type
    secondary
    Year
    2006
    Title
    *The Man Who Knew Too Much: Alan Turing and the Invention of the Computer*
    Author
    Leavitt, David
    Publication
    W.W. Norton
  • Note
    Memoir by Turing's mother, published shortly after his death; provides personal anecdotes and family context; limited but valuable primary source.
    Type
    secondary
    Year
    1959
    Title
    *Alan M. Turing*
    Author
    Turing, Sara (ed.)
    Publication
    Heffer
  • Note
    Holds Turing's personal papers, correspondence, and manuscripts; includes letters to Church, Gödel, and others; some materials remain restricted.
    Type
    archive
    Title
    Turing Archive
    Institution
    King's College, Cambridge
  • Note
    Houses Turing's papers from his Manchester period (1948–1954), including programming notes for the Mark 1 and correspondence with colleagues.
    Type
    archive
    Title
    Turing Archive for the History of Computing
    Institution
    University of Manchester
  • Note
    Contains Turing's declassified papers and reports from his work on the Bombe and Enigma decryption; some materials still under review.
    Type
    archive
    Title
    Declassified Bletchley Park Records
    Institution
    The National Archives, Kew
  • Note
    Preserves the site and artifacts of Bletchley Park, including restored Bombe machines, Enigma devices, and exhibits on Turing's work.
    Type
    museum
    Title
    Bletchley Park Museum
    Institution
    Bletchley Park Trust

Source of Truth

🗺 POCKET MAP
🗺 Museum Map
Galleries
Plan your visit
Your route
…tracing your steps…
QR code linking back to this exhibit
SCAN TO RETURN TO THIS EXHIBIT