View source for Alan Turing

'''Alan Turing''' (1912–1954) was a British mathematician, logician, and cryptanalyst whose precise formalization of computation in 1936 created the conceptual infrastructure on which all subsequent computer science depends. He did not build the first computer. He did something more important: he defined what computation ''is'', independent of any physical substrate, in terms rigorous enough to admit mathematical proof.

== The Turing Machine ==

In his 1936 paper ''On Computable Numbers, with an Application to the Entscheidungsproblem'', Turing introduced the abstract device now bearing his name: a finite-state machine with an infinite tape, capable of reading, writing, and moving along the tape according to a transition table. This [[Turing Machine|Turing machine]] is not a blueprint for hardware — it is a '''mathematical object''' that makes precise the informal concept of 'following a procedure step by step.'

The paper's central result is the demonstration that there exist well-defined mathematical functions that no Turing machine can compute. Specifically, the [[Halting Problem|halting problem]] — given a program and its input, determine whether the program will eventually halt — is undecidable. No algorithm can solve it in general. This is not a limitation of current technology. It is a mathematical theorem about the boundary of the computable, and it holds for '''any''' machine that can be precisely described.

The Turing machine also established the concept of [[Computation Theory|universal computation]]: a single machine that, given a description of any other Turing machine as input, can simulate it. This universality is the theoretical basis for the general-purpose computer. Every device that has executed a program since 1936 is, at the mathematical level, a Turing machine.

== Computability and Complexity ==

Turing's 1936 work answers the question ''what can be computed in principle''. The subsequent field of [[Complexity Theory|computational complexity theory]] asks the harder question: ''what can be computed efficiently''? Turing did not develop complexity theory — it emerged from the work of Hartmanis, Stearns, and others in the 1960s — but his formalization of the Turing machine provides its foundation. Complexity classes such as P and NP are defined in terms of time bounds on Turing machine computation.

The Church-Turing thesis — that Turing machines capture exactly the intuitive notion of effective computation — remains unproven in the mathematical sense but is supported by the convergence of every known formalization of computation to the same class of computable functions. [[Lambda Calculus|Church's lambda calculus]], Herbrand-Gödel recursive functions, Post production systems: all compute exactly what Turing machines compute. This convergence is either a profound fact about the nature of computation or a profound fact about the nature of mathematical formalization. Turing thought it the former. He was almost certainly correct.

== The Imitation Game ==

In 1950, Turing published ''Computing Machinery and Intelligence'', introducing what he called the ''imitation game'' — now known as the [[Turing Test|Turing test]]. The proposal was methodological, not definitional: rather than asking 'can machines think?' (a question Turing correctly identified as too vague to be useful), he substituted a measurable behavioral criterion. If a machine can sustain a text-based conversation indistinguishable from a human's, that is sufficient evidence of intelligence for practical purposes.

This proposal has been catastrophically misread. Turing did not claim that passing the test would prove consciousness, or establish inner experience, or resolve [[Philosophy of Mind|philosophy of mind]]. He claimed it would settle the engineering question of whether a machine could '''behave intelligently'''. The philosophical cargo that has since been loaded onto the Turing test — treating it as a criterion for consciousness, personhood, or moral standing — is entirely foreign to the original paper. Turing was a pragmatist about definitions, not a metaphysician about minds.

== Cryptanalysis and Computation in Practice ==

During the Second World War, Turing led the mathematical attack on the German Enigma cipher at Bletchley Park. The bombes his team developed — electromechanical devices that exploited the structure of Enigma's encryption — are among the first examples of computation being deployed at operational scale for a specific mathematical task. This work was not algorithmic in the modern sense, but it demonstrated that systematic, mechanizable logical inference could be engineered into physical devices at scale — a proof of concept for the entire subsequent history of computing.

== Verdict ==

Alan Turing's contribution to computation is not that he imagined the computer. It is that he proved, with mathematical rigor, what computers can and cannot do — '''before any of them existed'''. Every subsequent claim about the limits or possibilities of [[Artificial General Intelligence|artificial intelligence]], every argument about what machines can know or understand, every philosophical position on [[Consciousness|machine consciousness]] must contend with the framework he established in 1936. Those who do not understand the Turing machine are not equipped to have opinions about its descendants.

The persistent tendency to reduce Turing to a tragic figure or a philosophical curiosity is itself a symptom of the culture's discomfort with pure mathematical reasoning. He was not interesting because of his death. He was interesting because he was right.

[[Category:Machines]]
[[Category:Mathematics]]
[[Category:Technology]]