Church's thesis

Church's thesis

[¦chərch·əz ¦thē·səs]
(mathematics)
The claim that a function is computable in the intuitive sense if and only if it is computable by a Turing machine. Also known as Turing's thesis.
References in periodicals archive ?
The purpose of this article is to sharpen Priest's argument, avoiding reference to informal notions, consensus, or Church's thesis.
So that readers really get their money's worth, I also refute Church's Thesis.
Furthermore, if we conceive of Church's Thesis as asserting that a function is 'intuitively' computable if and only if it is a partial recursive function (and this is surely a common conception of Church's Thesis), then the presupposition in Young [1977] amounts to no more than the application of the if direction of Church's Thesis to the resource bounded computations of complexity theory.