Alan Turing Dead
Defined the universal machine in 1936, broke Enigma at Bletchley Park, and wrote the first chess program before hardware could run it.
190019251950197520002025
Defined the machine that bears his name in 'On Computable Numbers' (1936), proved the halting problem undecidable, then built the Bombe that broke Enigma and designed ACE — one of the first stored-program computers.\n\nThe 1950 'Imitation Game' paper founded AI's central question. The Turing Award is computing's Nobel.