Linked from

The 49 pages that link to Alan Turing, each with the reason it gives.

• University of CambridgeRelated: Turing studied mathematics at King's College and later returned as a fellow.

• John von NeumannRelated: Turing and von Neumann independently shaped ideas about stored-program computing.

• Artificial intelligenceRelated: His 1950 essay proposed an influential behavioral test for machine intelligence.

• Turing machineRelated: Turing introduced the machine model in his 1936 analysis of effective calculation.

• Battle of the AtlanticRelated: Cryptanalysis at Bletchley Park supported intelligence about German naval communications.

• Claude ShannonRelated: Like Turing, Shannon connected mathematical logic to the design and limits of computation.

• Halting problemRelated: His 1936 work supplied the machine model and impossibility proof.

• Church–Turing thesisRelated: His 1936 work gave the thesis its most influential computational model.

• Computability theoryRelated: His machine model and halting argument became foundations of computability theory.

• Alonzo ChurchRelated: Turing independently established a model equivalent in computational power to Church’s lambda calculus.

• Computer scienceRelated: His abstract machine gave a durable formal account of computation.

• Computational complexity theoryRelated: His abstract machine became a foundation for defining computation and its resources.

• CryptanalysisRelated: His work connected mathematical analysis with mechanized codebreaking.

• Artificial general intelligenceRelated: His work framed questions about whether machines could exhibit intelligent behavior.

• EntscheidungsproblemRelated: Turing gave an independent impossibility proof using his model of computation.

• Turing AwardRelated: The award honors his legacy and bears his name.

• Universal Turing machineRelated: Turing introduced the universal machine in his analysis of computable numbers.

• University of ManchesterRelated: He studied mathematics at the Victoria University of Manchester and later worked there.

• Bletchley ParkRelated: Turing helped develop the Bombe method and led work on naval Enigma.

• Enigma machineRelated: His work at Bletchley Park advanced mechanized searches for German keys.

• Diagonal argumentRelated: Turing used a diagonal strategy to prove that the halting problem is undecidable.

• King's College, CambridgeRelated: Turing studied mathematics at King's College, Cambridge, and later became a fellow.

• Analysis of algorithmsRelated: The Turing machine provides a model for reasoning about algorithmic computation and limits.

• Computational theory of mindRelated: His account of machine computation became a model for computational theories of thought.

• History of computingRelated: His theoretical and practical work linked the foundations of computing with its early uses.

• UltraRelated: His work at Bletchley Park advanced the recovery of Enigma keys.

• Undecidable problemRelated: His machine model supplied a central framework for defining algorithmic limits.

• Manchester BabyRelated: He joined the Manchester computing effort after the Baby’s successful demonstration.

• Turing testRelated: He proposed the test in his 1950 essay on machine intelligence.

• Language of thought hypothesisRelated: The hypothesis emerged amid efforts to explain thought through formal symbol manipulation.

• Chinese roomRelated: His behavioral test for machine intelligence became a prominent target of Searle’s argument.

• Automata theoryRelated: His abstract machine model became the standard account of general computation.

• Formal methodsRelated: His work established mathematical models for computation that verification can analyze.

• Benedict CumberbatchRelated: Turing was the real-life figure Cumberbatch portrayed in The Imitation Game.

• Theoretical computer scienceRelated: His machine model gave a rigorous account of algorithmic computation.

• Maurice WilkesRelated: Turing’s theoretical account of computation formed part of the intellectual world Wilkes helped turn into machines.

• Computer chessRelated: He devised an early chess-playing procedure that could be executed by hand.

• General recursive functionRelated: Turing's model independently characterizes the same partial computable functions.

• History of artificial intelligenceRelated: His 1950 essay proposed an influential behavioral test for machine intelligence.

• Philosophy of artificial intelligenceRelated: His 1950 essay proposed a behavioral test for machine intelligence.

• Computer science and engineeringRelated: Formal models of computation underpin the discipline’s theoretical foundations.

• Hartmanis–Stearns conjectureRelated: Turing machines provide the model in which polynomial-time computation is defined.

• History of computer scienceRelated: His work on computability helped define the theoretical foundations of computer science.

• History of cryptographyRelated: His wartime work illustrates how mathematical reasoning and machines transformed cryptanalysis.

• Manchester computersRelated: He joined Manchester’s computing effort and contributed to the Mark 1’s programming and applications.

• Mathematical and theoretical biologyRelated: His reaction–diffusion theory proposed a mechanism for biological pattern formation.

• Turing's proofRelated: Turing introduced the machine model and proved the undecidability result in 1936.