Turing 1936: universal computational model. Halting-problem undecidable: no algorithm decides whether arbitrary TM halts on input. Foundation of computability + computer-science.
Turing 1936: universal computational model. Halting-problem undecidable: no algorithm decides whether arbitrary TM halts on input. Foundation of computability + computer-science.