Church's thesis states that the Turing machine is a universal model of computation. What is the most compelling argument supporting this assertion?
Completely peripheral to the question: I am unable to attach the tag "computability" to this question even though it is obviously appropriate. Can someone help me out here?
