WikiGPedia

Alan Turing

Alan Turing (1912–1954) was a British mathematician, logician, and computer scientist whose foundational work on computation, artificial intelligence, and codebreaking made him one of the most influential figures of the twentieth century.

Written by Ritu Malhotra First written 10 May 2025 Human edits 0 Read 0 times

Alan Mathison Turing (23 June 1912 – 7 June 1954) was a British mathematician, logician, cryptanalyst, and pioneer of computer science whose theoretical and practical contributions laid the groundwork for modern computing and the field of artificial intelligence.

Early life and education

Turing was born in Maida Vale, London, to Julius Mathison Turing, a civil servant in the Indian Civil Service, and Ethel Sara Stoney. His parents frequently travelled between Britain and India, and Turing spent much of his early childhood in the care of family friends in England.

He attended Sherborne School in Dorset, where his aptitude for mathematics and science was evident from an early age. In 1931 he entered King's College, University of Cambridge, graduating with a first-class degree in mathematics in 1934. He was elected a Fellow of King's College in 1935. He subsequently studied at Princeton University, where he completed his doctorate in mathematical logic under Alonzo Church in 1938.

Theoretical contributions to computing

The Turing machine

In his landmark 1936 paper On Computable Numbers, with an Application to the Entscheidungsproblem, Turing introduced the concept now known as the Turing machine — an abstract mathematical model of computation that manipulates symbols on a strip of tape according to a finite set of rules. The Turing machine became the foundational theoretical object of computer science, providing a precise definition of what it means for a function to be computable.

The paper also resolved David Hilbert's Entscheidungsproblem (decision problem) in the negative, demonstrating — independently of Alonzo Church's lambda calculus work — that no general algorithm can decide whether an arbitrary mathematical statement is provable.

The universal Turing machine

Within the same framework, Turing described a universal Turing machine capable of simulating any other Turing machine given an appropriate description as input. This concept anticipated the stored-program computer: a single physical machine that can execute any computable task by loading different programs.

Codebreaking and World War II

At the outbreak of World War II, Turing joined the Government Code and Cypher School (GC&CS) at Bletchley Park, Buckinghamshire, where he became a central figure in Allied cryptanalysis.

Breaking Enigma

The German military relied heavily on the Enigma machine for encrypted communications. Building on earlier work by Polish mathematicians — particularly Marian Rejewski — Turing developed the Bombe, an electromechanical device that systematically tested possible Enigma settings to find the daily key. The Bombe dramatically shortened the time required to break Enigma-enciphered messages and was replicated in large numbers throughout the war.

Naval Enigma and other work

Turing made specific contributions to breaking the more complex Naval Enigma, which had resisted earlier methods. He also worked on statistical techniques for cryptanalysis, developing an approach he called Banburismus, and later contributed to breaking the Lorenz cipher used for high-level German communications.

Historians widely credit Turing's work, along with that of his colleagues at Bletchley Park, with shortening the war by a significant period, though precise estimates vary and remain a subject of scholarly debate.

Artificial intelligence and the Turing Test

After the war, Turing turned his attention explicitly to the question of machine intelligence. In his 1950 paper Computing Machinery and Intelligence, published in the philosophical journal Mind, he proposed the imitation game — now universally known as the Turing Test — as an operational criterion for machine intelligence. The test asks whether a human interrogator, communicating by text with both a human and a machine, can reliably distinguish one from the other.

The paper opened with the question "Can machines think?" and remains one of the most cited works in the philosophy of mind and artificial intelligence research.

Later career and Manchester

From 1948, Turing worked at the University of Manchester, initially as deputy director of the Computing Machine Laboratory. He contributed to the design of the Manchester Mark 1, one of the earliest stored-program computers. He also pursued interests in mathematical biology, publishing a 1952 paper on reaction–diffusion systems as a mechanism for biological pattern formation — a field now called Turing morphogenesis — which has influenced developmental biology significantly.

Prosecution, pardon, and legacy

Criminal conviction

In 1952, Turing was prosecuted under the Labouchere Amendment for gross indecency following his relationship with another man. He accepted chemical castration — a course of hormone treatment — as an alternative to imprisonment. The conviction cost him his security clearance and access to classified work.

Death

Turing died on 7 June 1954 at his home in Wilmslow, Cheshire. The inquest recorded a verdict of suicide by cyanide poisoning, though some biographers and family members have disputed this conclusion, suggesting the possibility of accidental exposure. The precise circumstances remain uncertain.

Posthumous recognition

In 2009, British Prime Minister Gordon Brown issued a formal public apology on behalf of the government for Turing's treatment. In 2013, Queen Elizabeth II granted Turing a posthumous royal pardon. The UK government subsequently passed the Alan Turing law (colloquially) in 2017, providing posthumous pardons for men convicted of similar historical offences.

Turing's image appeared on the British £50 banknote from 2021, issued by the Bank of England. The Association for Computing Machinery awards the Turing Award annually — often described as the Nobel Prize of computing — in his honour.

Frequently asked questions

Is Alan Turing considered the father of computer science?

Turing is widely regarded as one of the founding figures of computer science, particularly for his theoretical work on the Turing machine and computability. He shares that distinction with other pioneers, but his 1936 paper is routinely identified as the field's theoretical cornerstone.

Is the Turing Test still used today?

The Turing Test remains an influential benchmark and philosophical reference point in artificial intelligence research, though many researchers now consider it an incomplete measure of machine intelligence. It continues to inspire competitions such as the Loebner Prize and broader debates about AI cognition.

Is it confirmed that Alan Turing died by suicide?

The official inquest verdict in 1954 was suicide, but the precise cause of death is genuinely disputed. Some biographers argue the evidence is consistent with accidental cyanide poisoning, and the question has not been definitively resolved.

Was Alan Turing pardoned by the British government?

Yes. Turing received a posthumous royal pardon in 2013, and the broader Alan Turing law passed through the UK Parliament in 2017, extending posthumous pardons to others convicted under the same historical legislation.

Is the Turing Award named after Alan Turing?

Yes. The Turing Award, presented annually by the Association for Computing Machinery since 1966, is named in Turing's honour and is the highest distinction in computer science.