Alan Mathison Turing was a British mathematician and logician whose work on computable numbers defined the very notion of algorithmic computation. His abstract machine model — the Turing machine — established the boundary between what is and is not computable, while his later work on machine intelligence posed the question of whether machines could think, directly catalysing the field of artificial intelligence and, by extension, computational linguistics.
Early Life and Education
Born in London in 1912, Turing showed extraordinary mathematical talent from an early age. He studied mathematics at King's College, Cambridge, and in 1936 published his landmark paper "On Computable Numbers," which introduced the concept of the universal Turing machine. He completed his PhD at Princeton under Alonzo Church in 1938, exploring the relationship between his machine model and Church's lambda calculus.
Born in Maida Vale, London
Published "On Computable Numbers, with an Application to the Entscheidungsproblem"
Led codebreaking efforts at Bletchley Park during World War II
Published "Computing Machinery and Intelligence," proposing the Turing test
Died in Wilmslow, Cheshire
Key Contributions
The Turing machine is an abstract device consisting of a tape, a head, and a finite set of states. It reads and writes symbols according to a transition function, and it formalises what it means for a function to be computable. The Church–Turing thesis — that any effectively calculable function can be computed by a Turing machine — remains the foundational assumption of theoretical computer science.
In his 1950 paper "Computing Machinery and Intelligence," Turing proposed the imitation game, now known as the Turing test: if a machine can converse in natural language indistinguishably from a human, it should be considered intelligent. This framing placed natural language understanding at the centre of the AI enterprise and directly motivated research in dialogue systems, question answering, and natural language generation.
"We can only see a short distance ahead, but we can see plenty there that needs to be done." — Alan Turing, "Computing Machinery and Intelligence" (1950)
Legacy
Turing's theoretical framework defines the outermost boundary of the Chomsky hierarchy (Type 0 grammars generate exactly the recursively enumerable languages recognised by Turing machines). His Turing test remains the most discussed benchmark for conversational AI. The annual Turing Award, granted by the ACM, is the highest honour in computer science. Turing's influence on computational linguistics is both foundational and enduring.