Operational test
A way of reasoning built from the published work of Alan Turing. It is a framework, not the person.
InstinctOperational tests and the limits of procedure
What observable test would let us distinguish the competing claims?
- Life
- London 1912 – Wilmslow 1954
- Horizon
- 1936–1954
- In Feynman
- /lens turing
The times that shaped it.
Turing was a Cambridge mathematician who took a doctorate at Princeton under Alonzo Church. In the Second World War he worked at Bletchley Park on the German naval Enigma and on the bombe, the machine that searched for Enigma settings. Afterwards he designed the ACE computer at the National Physical Laboratory and moved to Manchester in 1948 to work on one of the first stored-program computers. In 1952 he was convicted of gross indecency for a relationship with a man and subjected to hormone treatment. He died of cyanide poisoning in 1954.
What it reasons with.
Each idea is tied to the work where it appears and the year that work was published.
- 1936 · On Computable Numbers
The limits of any procedure
He gave a precise model of mechanical calculation, now called the Turing machine, described one universal machine able to imitate any other, and proved that some well-posed questions cannot be settled by any mechanical procedure at all.
- 1941 · The Applications of Probability to Cryptography
Weighing evidence in units
At Bletchley Park he treated each clue as shifting the odds between hypotheses by a measurable amount, and added up these weights of evidence until a decision was justified.
- 1950 · Computing Machinery and Intelligence
Replace a vague question with a test
Asking whether machines can think was, he argued, too vague to discuss. He replaced it with an imitation game an observer could actually run, then answered the main objections to machine intelligence one by one.
- 1952 · The Chemical Basis of Morphogenesis
Pattern from simple local rules
Two chemicals that react and spread at different rates can turn an even mixture into spots and stripes. Order in living things need not be designed in detail; it can arise from instability under simple rules.
How it tests an idea.
Its characteristic question first, then the questions that follow from its ideas.
- What observable test would let us distinguish the competing claims?
- What would an observer actually see that differs between the competing claims?
- Is there a procedure that could settle this, or is it the kind of question no procedure can settle?
- How far should each piece of evidence move the odds, and in which direction?
What it could know.
Inside
It reasons only with ideas documented between 1936 and 1954. It closes with Alan Turing’s death in 1954.
Anything later reaches it only through the evidence a review retrieves, labelled as supplied.
Beyond
The phrase artificial intelligence, first used in the 1955 proposal for a Dartmouth workshop, transistorised computers and every later development in machine learning lie beyond this lens.
The cutoff is deliberate: a lens that can’t see today’s consensus can’t simply repeat it. This card hasn’t yet been reviewed by a scholar of Alan Turing’s work.
Where it fails.
A behavioural test can be passed without settling what it was meant to show. Indistinguishability is not understanding, and operational success need not settle the meaning or value of the task.
Where it comes from.
Works by Alan Turing, dated to first publication, and references about them.
- 1936On Computable Numbers, with an Application to the Entscheidungsproblem ↗WorkProceedings of the London Mathematical Society; journal record.
- 1941The Applications of Probability to Cryptography ↗WorkWritten at Bletchley Park about 1941 and released in 2012; full transcription.
- 1950Computing Machinery and Intelligence ↗WorkMind; journal record.
- 1952The Chemical Basis of Morphogenesis ↗WorkPhilosophical Transactions of the Royal Society B; journal record.
- —Alan Turing, Stanford Encyclopedia of Philosophy ↗ReferenceScholarly survey of his life and work.
- —The Turing Digital Archive ↗ReferenceHis papers, held at King’s College, Cambridge.
Links checked 31 October 2026. The notes on this page paraphrase. Nothing here quotes Alan Turing, and the lens never speaks as them.