Alan Turing
Father of computer science who broke the Enigma code, conceived the Turing Test, and laid the foundations of artificial intelligence
Alan Turing (1912-1954) was a British mathematician and computer scientist, regarded as the father of computer science and a founder of artificial intelligence. In 1936 he published the landmark paper 'On Computable Numbers,' theoretically defining how computers work through the Turing machine model. During WWII he led the Bletchley Park team that broke the German Enigma cipher — historians estimate this shortened the war by 2-4 years and saved tens of millions of lives. In 1950 his paper 'Computing Machinery and Intelligence' proposed the Turing Test, first seriously examining whether machines can think and laying the philosophical foundation for AI. In 1952 he was prosecuted for homosexuality and subjected to forced chemical castration by the British government; he died of cyanide poisoning in 1954 in an officially ruled suicide, though circumstances remain disputed. In 2013, Queen Elizabeth II granted him a posthumous pardon.
Methodologies
- Abstract Machine Method: Using Concrete Imagination to Solve Abstract Problems - When facing complex abstract problems, construct the simplest possible imaginary machine or system and reveal the problem's essence by analyzing its behavior.
- Behavioral Equivalence Test Method - When you cannot directly verify a system's internal mechanism, judge its capability by observing behavior in standardized scenarios — behavioral equivalence means functional equivalence.
Key decisions and timeline
- Born in Paddington, London - Early solitude and independence sometimes cultivates stronger capacity for independent thinking.
- Entered King's College Cambridge to Study Mathematics - Independently rediscovering a known theorem is also important — it demonstrates thinking capacity, not merely knowledge accumulation.
- Published 'On Computable Numbers,' Proposing the Turing Machine Model - Concretizing abstract problems (even with an imaginary machine) is a powerful strategy for solving deep theoretical problems.
Beliefs and mental models
- Belief 1 - Turing believed computational processes in mathematics could be precisely formalized. His Turing machine model proved that any mechanically executable algorithm can be simulated by a universal Turing machine — the theoretical cornerstone of all computer science.
- Belief 2 - Turing defined intelligence not philosophically but from engineering and behaviorist perspectives: if a machine cannot be distinguished from a human in conversation, it is intelligent in practical terms. This operational definition bypassed philosophical questions about consciousness and directly pushed AI research toward practical orientation.
- Belief 3 - In his later years Turing turned to mathematical biology, proposing reaction-diffusion equations to explain biological morphogenesis. He believed natural patterns from leopard spots to embryonic development arise from simple mathematical laws — his theoretical computer science thinking method penetrated into exploration of life's fundamental nature.
- Model 1
- Model 2
- Model 3