Turing 1936: machines, computable numbers, and the halting problem
Alan Turing defined an abstract model of computation and proved the undecidability of the halting problem, founding computer science.
1 articles
Computabilidad
Index of editorial tags and filtered coverage.