Alan Turing

Alan Turing (23 June 1912 to 7 June 1954) was a British mathematician, logician, and codebreaker who is widely regarded as the founder of theoretical computer science and a foundational figure in artificial intelligence. ^[1][7] His 1936 concept of a universal machine defined the limits of what any computer can calculate, his codebreaking at Bletchley Park helped the Allies win the Second World War, and his 1950 paper posed the question that still frames the field, "Can machines think?", introducing the test now known as the Turing test. ^[3][4][6] Computing's most prestigious prize, the ACM A.M. Turing Award, is named in his honour. ^[9]

What is Alan Turing known for?

Turing is best known for four contributions that each reshaped a field. In mathematical logic, his 1936 paper "On Computable Numbers, with an Application to the Entscheidungsproblem" introduced the abstract device now called the Turing machine and proved that some problems can never be solved by computation. ^[3] During the Second World War he led the effort to break the German naval Enigma cipher at Bletchley Park, work that historians estimate shortened the war by two to four years. ^[6] In 1950 he founded the modern discussion of machine intelligence with the imitation game, or Turing test. ^[4][11] And in 1952 he pioneered mathematical biology with a theory of how patterns form in living organisms. ^[5] He was appointed OBE in 1946 and elected a Fellow of the Royal Society in 1951. ^[7][12]

Life and career timeline

Scroll sideways for more →

Early life and education

Alan Mathison Turing was born in Maida Vale, London, on 23 June 1912. ^[2][7] He was educated at Sherborne School in Dorset, where his gift for mathematics and science was already evident, and in 1931 he entered King's College, Cambridge, to read mathematics. ^[12][13] He was elected a Fellow of King's College in 1935, at the age of 22, for a dissertation that independently proved a version of the central limit theorem. ^[12] From 1936 to 1938 he studied at Princeton University, completing a PhD in mathematical logic under Alonzo Church, the American logician whose work he had extended. ^[1][13]

What was the Turing machine?

In 1936, while still in his early twenties, Turing published "On Computable Numbers, with an Application to the Entscheidungsproblem" in the Proceedings of the London Mathematical Society. ^[3] To settle a question posed by David Hilbert about whether all of mathematics could be mechanised, Turing imagined a simple abstract device, which he called an a-machine and which is now universally called a Turing machine: a read-write head moving along an unbounded tape according to a finite table of rules. ^[1][3] He showed that a single universal machine could be programmed to imitate any other such machine, an insight that is the theoretical basis of the general-purpose, programmable computer. ^[1] He also proved that some questions, such as the halting problem of deciding whether an arbitrary program will ever stop, are undecidable, giving a negative answer to Hilbert's Entscheidungsproblem. ^[3] These results founded the theory of computation on which all modern computing rests. ^[1][13]

What did Turing do at Bletchley Park?

When war broke out in 1939, Turing joined the Government Code and Cypher School at Bletchley Park, Britain's codebreaking centre. ^[6] He led Hut 8, the section responsible for German naval Enigma traffic, and with Gordon Welchman designed the Bombe, an electromechanical machine that rapidly searched through Enigma's possible settings; more than 200 Bombes were eventually built. ^[6] Turing also devised a statistical technique called Banburismus to speed the process. ^[2] Breaking naval Enigma let the Allies route convoys away from U-boat "wolf packs" in the Battle of the Atlantic, and the intelligence produced at Bletchley, code-named Ultra, is credited by historians with shortening the war by two to four years and saving many lives. ^[6] For this work Turing was appointed an Officer of the Order of the British Empire (OBE) in 1946. ^[7]

Post-war computing: the ACE and Manchester

After the war Turing turned from theory to real machines. In 1945 he joined the National Physical Laboratory, where he produced a detailed design for the Automatic Computing Engine (ACE), one of the earliest full specifications for a stored-program computer. ^[7][13] A reduced version, the Pilot ACE, ran its first program on 10 May 1950. ^[13] In 1948 he moved to the University of Manchester as Deputy Director of the Computing Machine Laboratory, where he worked on the Manchester machines and wrote the programmer's handbook for the Ferranti Mark 1, the world's first commercially available general-purpose computer. ^[7][13] This hands-on period bridged his abstract 1936 machine and the physical computers that would later run the first AI programs. ^[1]

What is the Turing test?

In October 1950 Turing published "Computing Machinery and Intelligence" in the philosophy journal Mind, the paper that opened the modern discussion of artificial intelligence. ^[4] It begins, "I propose to consider the question, 'Can machines think?'" ^[4] Judging that question too vague to settle directly, Turing replaced it with a practical test he called the imitation game: a human interrogator holds a text conversation with a person and a machine, both hidden from view, and if the interrogator cannot reliably tell which is the machine, the machine is deemed to have passed. ^[4][11] This imitation game is what is now called the Turing test, and it remains a touchstone in debates about whether systems such as modern chatbots and large language models genuinely think. ^[11]

The same paper also anticipated machine learning. Rather than hand-coding an adult intelligence, Turing suggested building a simple learner and training it, asking, "Instead of trying to produce a programme to simulate the adult mind, why not rather try to produce one which simulates the child's?" ^[4] This "child machine" idea, of a system that improves through education and experience rather than fixed instructions, prefigures the way modern AI models are trained on large amounts of data. ^[4]

Morphogenesis and mathematical biology

In 1952 Turing published "The Chemical Basis of Morphogenesis" in the Philosophical Transactions of the Royal Society. ^[5] It proposed that interacting chemicals he called morphogens, diffusing and reacting across a tissue, can spontaneously produce patterns such as spots and stripes, a mechanism now known as a reaction-diffusion or Turing system. ^[5] Largely overlooked in his lifetime, the theory became foundational in developmental biology and is still used to explain natural patterning, an early example of Turing generating complex behaviour from simple rules. ^[5]

Persecution, death, and pardon

In 1952 Turing was prosecuted for homosexual acts, then illegal in Britain, and convicted of gross indecency. ^[7] To avoid prison he accepted hormone treatment, a form of chemical castration, and the conviction also cost him his security clearance. ^[2][7] On 7 June 1954 Turing was found dead at his home in Wilmslow, aged 41, from cyanide poisoning; an inquest recorded a verdict of suicide, though some scholars argue that accidental poisoning cannot be ruled out. ^[2][7] In 2009 Prime Minister Gordon Brown issued an official apology for the "appalling" way Turing had been treated, and in 2013 Queen Elizabeth II granted him a posthumous royal pardon. ^[10] The 2017 law that extended pardons to tens of thousands of other men convicted under the same statutes is informally known as the "Alan Turing law." ^[10]

How is Turing remembered in AI?

Turing's ideas underpin both computing and artificial intelligence. Every general-purpose computer is a physical realisation of his universal machine, and the Turing test remains the most widely known benchmark for machine intelligence, invoked whenever a new AI system appears to converse like a human. ^[1][11] Since 1966 the Association for Computing Machinery has awarded the ACM A.M. Turing Award, often called the "Nobel Prize of Computing," to leading computer scientists; its first recipient was Alan Perlis, and later laureates include pioneers of machine learning. ^[9] In 2021 the Bank of England put Turing on its polymer 50-pound note, issued on 23 June that year to mark his birthday. ^[8] From the theory of computation to the "child machine" that foreshadowed machine learning, Turing framed the questions that the field of AI is still working to answer. ^[1][4]

References

1. Stanford Encyclopedia of Philosophy, "Alan Turing." https://plato.stanford.edu/entries/turing/ ↩
2. Andrew Hodges, "Alan Turing: The Enigma" and the Alan Turing Internet Scrapbook. https://www.turing.org.uk/ ↩
3. Turing, A. M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem." Proceedings of the London Mathematical Society, s2-42, 230-265. ↩
4. Turing, A. M. (1950). "Computing Machinery and Intelligence." Mind, 59(236), 433-460. https://academic.oup.com/mind/article/LIX/236/433/986238 ↩
5. Turing, A. M. (1952). "The Chemical Basis of Morphogenesis." Philosophical Transactions of the Royal Society of London B, 237(641), 37-72. https://royalsocietypublishing.org/doi/10.1098/rstb.1952.0012 ↩
6. Imperial War Museums, "How Alan Turing Cracked the Enigma Code." https://www.iwm.org.uk/history/how-alan-turing-cracked-the-enigma-code ↩
7. Encyclopaedia Britannica, "Alan Turing." https://www.britannica.com/biography/Alan-Turing ↩
8. Bank of England, "The new 50-pound note unveiled" (2021). https://www.bankofengland.co.uk/news/2021/march/the-new-50-note-unveiled ↩
9. Association for Computing Machinery, "A. M. Turing Award." https://amturing.acm.org/ ↩
10. GOV.UK, "Royal pardon for WW2 code-breaker Dr Alan Turing" (2013); Policing and Crime Act 2017 ("Alan Turing law"). https://www.gov.uk/government/news/royal-pardon-for-ww2-code-breaker-dr-alan-turing ↩
11. Stanford Encyclopedia of Philosophy, "The Turing Test." https://plato.stanford.edu/entries/turing-test/ ↩
12. King's College, Cambridge, "Alan Mathison Turing (1912-54)." https://www.kings.cam.ac.uk/alan-mathison-turing-1912-54 ↩
13. MacTutor History of Mathematics Archive, "Alan Mathison Turing." https://mathshistory.st-andrews.ac.uk/Biographies/Turing/ ↩