| 释义 |
Church's thesis (Church-Turing thesis) The principle that any definition of a computable function on the natural numbers—one that can be effectively implemented, for example by an algorithm—will lead to the same computable functions as in Church's and Turing's work. As such, the thesis is unprovable, though no counterexample has been found amongst subsequent alternative definitions of computable.
|