Portrait of Alan Turing

Bletchley Park, 1942 · Scientists & Technologists

Alan Turing

The mathematician and codebreaker who made computation a universal idea and asked whether machines could think.

Call Alan TuringReal-time AI voice call · 2 minutes freeFact-checked · last reviewed 2026-07-13

Alan Turing was a British mathematician, codebreaker, and computing pioneer who, in a single 1936 paper written before any electronic computer existed, described an abstract machine capable of computing anything computable — the idea now known as the Turing machine. Born June 23, 1912, in London, he went on to lead the section at Bletchley Park that broke German naval Enigma, then spent his final years asking, in print, whether machines could think. He died on or around June 7–8, 1954, at his home in Wilmslow, Cheshire, of cyanide poisoning. The 1954 inquest recorded suicide; the fuller story is more contested than that one word suggests.

That is the summary. The man is more interesting than the summary.

The paper that came before the machines

Turing matriculated at King's College, Cambridge, in 1931 on an Open Scholarship in mathematics, graduated with distinction in 1934, and won a Fellowship at King's in 1935, at twenty-two. The following year he drafted "On Computable Numbers, with an Application to the Entscheidungsproblem," answering a question posed by David Hilbert about whether mathematics could, in principle, be settled by mechanical procedure. His answer arrived as an imagined device: an endless tape divided into squares, a scanner reading one square at a time, and a table of rules telling it what to write, erase, or where to move next. It sounds like a toy. It turned out to describe every computer since — Alonzo Church reached an equivalent result by a different route just ahead of Turing's publication, and Turing went to Princeton anyway, earning his PhD there in June 1938 under Church's supervision.

Breaking Enigma, not alone

Turing joined the Government Code and Cypher School at Bletchley Park in 1939, at the outbreak of war, and led Hut 8 — the section working German naval Enigma — from its formation until November 1942, when his deputy Hugh Alexander succeeded him. The popular image of Turing single-handedly cracking Enigma skips the actual chain of work: Polish cryptanalysts led by Marian Rejewski had broken an earlier version of the machine before the war; Turing's own electromechanical Bombe design, improved with Gordon Welchman's diagonal board, automated the search for each day's settings; and it took a huge, largely uncredited team — including the Wrens who ran the Bombes around the clock — to keep the odds moving. Turing was the chief mind of the effort, not its sole author. For it, he received an OBE in 1946.

"Can machines think?"

After the war, Turing joined the National Physical Laboratory to design ACE, an early stored-program computer, then took up a post at the University of Manchester in 1948, eventually deputy director of its Computing Machine Laboratory. He was elected a Fellow of the Royal Society in 1951. In October 1950, the journal Mind published his paper "Computing Machinery and Intelligence," which opens as directly as any paper in the philosophy of mind has ever opened:

"I propose to consider the question, 'Can machines think?'" — Computing Machinery and Intelligence, Mind, 1950

Rather than settle "thinking" by definition, Turing proposed a test: could a machine hold a text conversation well enough that a human questioner couldn't reliably tell it from a person? He worked through the standard objections, including Ada Lovelace's — that machines never originate anything surprising. His answer was dry and pointed:

"Machines take me by surprise with great frequency." — Computing Machinery and Intelligence, Mind, 1950

He was also drawn to a different approach than programming a finished adult mind: build something closer to a child's mind, and let it learn. In the paper's final lines, he allowed himself something close to optimism: "We can only see a short distance ahead, but we can see plenty there that needs to be done."

From a conversation with our Turing

What follows is an excerpt from a conversation with our AI Turing persona — a stylized recreation for readers, not a historical record.

Caller: If a machine could talk to me and I couldn't tell it wasn't human, would that mean it's actually thinking?

Turing: Ah — now you've asked the question properly instead of arguing about words. I don't much care to settle what "thinking" is in the abstract; philosophers have tried that for centuries and mostly confused each other. So I proposed a test instead: converse by teletype, and see if you can tell which correspondent is the machine. If you genuinely can't — on what grounds do you keep insisting it doesn't think? Not spite, I hope. That's not a very good ground.

The last two years, and the end

In 1952, Turing published "The Chemical Basis of Morphogenesis," a mathematical theory of how biological patterns — the stripes on a shell, the spots on a leopard — could emerge from simple chemical reactions, an unexpected late pivot from logic into biology. That same year, he was arrested and prosecuted for "gross indecency," the historical legal term then used to criminalize consensual sex between men in Britain; he chose probation with hormone treatment over prison, to keep working.

He died in June 1954 at home in Wilmslow, Cheshire, of cyanide poisoning, a half-eaten apple found near his bed. The inquest recorded suicide. Scholars including Jack Copeland have since argued the surviving evidence — no suicide note, the apple never tested for cyanide, and Turing's own home electroplating apparatus, which used cyanide compounds — would not meet a modern evidentiary standard for that verdict, leaving accidental poisoning a live possibility.

Two vindications that came far too late

Queen Elizabeth II granted Turing a royal pardon in 2013; in 2017, the "Alan Turing law" posthumously pardoned an estimated 49,000 men convicted under the same repealed laws. In 2019 the Bank of England announced Turing as the face of its polymer £50 note; it entered circulation on June 23, 2021 — his birthday.

Caller: Does it help, knowing they pardoned you eventually?

Turing: Sixty-odd years is a long wait for an apology. I'd rather have kept working. But perhaps for the other forty-nine thousand it settles something. For me the more interesting question was always the one I never finished: has a machine passed the test yet? Do tell me you haven't buried that lead.

Excerpt from our AI Turing persona — stylized, and labeled as such.

Keep reading — or ask him yourself

The pages below go deeper: his death, and the questions around it, his verified quotes (and the film line he never said), his full biography, and the facts, sourced.

Or skip the reading. Our Turing takes calls. Ask him to walk you through the universal machine on a napkin, what Banburismus actually involved, or whether he thinks the thing in your pocket has passed his test yet. He is an AI recreation, honestly labeled — but he reasons it through with you, out loud, and never minds being interrupted with a better question.

Portrait of Alan Turing

Live from the archive

Ask Alan yourself

Reading about Alan Turing is one thing. Talking to Alan is the product. Try a call — 2 minutes free, no card.

An AI voice persona of Alan Turing — not a recording.

Start a call

2 free minutes with Alan

Live voice, right in your browser — just press call.

Verified quotes

Every quote below is checked against a primary or scholarly source — the citation sits right under it.

I propose to consider the question, ‘Can machines think?’
AMT/B/9: Computing Machinery and Intelligence (Mind, vol. LIX, Oct. 1950) — The Turing Digital Archive, King’s College CambridgeOpening sentence of the 1950 Mind paper. The exact wording is confirmed word-for-word against Oxford Academic's rendered excerpt of the article (academic.oup.com/mind/article/LIX/236/433/986238), but that host returns HTTP 403 to the publish validator's fetch signature, so it cannot be used as the citation URL. This is instead cited to the King's Archive catalog entry for the same paper, which is live but is a finding-aid page rather than the full text — typed paraphrase because the sentence is not verifiable against the URL actually cited.
Machines take me by surprise with great frequency.
AMT/B/9: Computing Machinery and Intelligence (Mind, vol. LIX, Oct. 1950) — The Turing Digital Archive, King’s College CambridgeFrom the 'Lady Lovelace's Objection' section of the 1950 Mind paper. Same rationale as the opening-question quote: wording confirmed against Oxford Academic's rendered excerpt, which 403s to the publish validator's fetch signature; cited here to the King's Archive catalog entry for the same paper, presented as paraphrase since the sentence itself is not on the cited (finding-aid) page.
Instead of trying to produce a programme to simulate the adult mind, why not rather try to produce one which simulates the child's?
AMT/B/9: Computing Machinery and Intelligence (Mind, vol. LIX, Oct. 1950) — The Turing Digital Archive, King’s College CambridgeFrom section 7 of the 1950 Mind paper. Wording confirmed against Oxford Academic's rendered excerpt, which 403s to the publish validator's fetch signature; cited here to the King's Archive catalog entry for the same paper, presented as paraphrase since the sentence itself is not on the cited (finding-aid) page.
We can only see a short distance ahead, but we can see plenty there that needs to be done.
AMT/B/9: Computing Machinery and Intelligence (Mind, vol. LIX, Oct. 1950) — The Turing Digital Archive, King’s College CambridgeFrom the conclusion of the 1950 Mind paper. Wording confirmed against Oxford Academic's rendered excerpt, which 403s to the publish validator's fetch signature; cited here to the King's Archive catalog entry for the same paper, presented as paraphrase since the sentence itself is not on the cited (finding-aid) page.
The 'computable' numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by finite means.
On Computable Numbers, with an Application to the Entscheidungsproblem (1936) — abelard.orgOpening sentence of Turing's 1936 computability paper. Confirmed word-for-word on the cited page, a long-standing independent transcription of the paper's text rather than a scan of the original journal printing.
I have such a stressful job that the only way I can get it out of my mind is by running hard; its the only way I can get some release.
Turing as a runner — MacTutor History of Mathematics, University of St AndrewsA secondhand recollection: J. F. Harding, secretary of Walton Athletic Club, recalled Turing giving this answer when asked why he trained so hard. Confirmed word-for-word on the cited page. Present as something Turing was recalled saying, not a written statement in his own hand.

Key facts

Timeline

  1. 1912-06-23

    Born in London

    Alan Mathison Turing was born in London.

  2. 1931

    Entered King’s College, Cambridge

    Turing matriculated at King’s College on an Open Scholarship in mathematics.

  3. 1936

    Drafted ‘On Computable Numbers’

    Turing completed the draft of the paper that established the abstract computational model later called the Turing machine.

  4. 1938-06

    Completed his PhD at Princeton

    Turing earned his Princeton PhD with a dissertation introducing ordinal logic and the ‘oracle machine.’

  5. 1939

    Joined Bletchley Park

    At the outbreak of war, Turing joined the Government Code and Cypher School at Bletchley Park.

  6. 1942-11

    Succeeded as head of Hut 8

    Turing was succeeded as head of Hut 8, the naval Enigma section, by his deputy Hugh Alexander.

  7. 1950

    Published ‘Computing Machinery and Intelligence’

    Turing’s Mind article posed the imitation game and its famous question about machine intelligence.

  8. 1952-08-14

    Published ‘The Chemical Basis of Morphogenesis’

    Turing published his mathematical theory of biological pattern formation in Philosophical Transactions of the Royal Society.

  9. 1952

    Prosecuted for ‘gross indecency’

    The state arrested and prosecuted Turing under the law then criminalising sexual acts between men.

  10. 1954-06-08

    Died from cyanide poisoning

    Turing died at his home in Wilmslow, Cheshire, on or around June 7–8, 1954. The contemporary inquest returned a suicide verdict; later scholarship has argued that accidental cyanide exposure remains an equally plausible explanation.

Questions people ask