Turing 1936: TM = (Q, Sigma, Gamma, delta, q0, F); halting problem H = {(M, w) : M halts on w} undecidable; Church-Turing thesis equates effective-computability with TM-computability.
Turing 1936: TM = (Q, Sigma, Gamma, delta, q0, F); halting problem H = {(M, w) : M halts on w} undecidable; Church-Turing thesis equates effective-computability with TM-computability.