Return to Revisions

3 of 3

deleted 177 characters in body

edited Oct 30, 2009 at 0:49

775
1
13
18

What is the most compelling reason to believe Church's thesis?

Church's thesis states that the Turing machine is a universal model of computation. What is the most compelling argument supporting this assertion?

soft-question algorithms computability-theory

asked Oct 30, 2009 at 0:38

775
1
13
18