The ____ thesis can never be proved because the definition of an algorithm is descriptive, not mathematical.
A)Church-Zimmerman
B)Church-Turing
C)Church-Alan
D)Alan-Zimmerman

Question

Quizplus · Accepted Answer

The Church-Turing thesis posits that any computation that can be performed by a human using an algorithm can also be performed by a Turing machine. It is a foundational concept in computer science and theoretical mathematics, but it is not a theorem that can be proved in the mathematical sense because it is based on the intuitive notion of what an algorithm is, rather than a strictly formal mathematical definition.

The ____ Thesis Can Never Be Proved Because the Definition