Church's thesis (constructive mathematics)

Church's thesis, also known as Church's conjecture or the Church-Turing thesis, is a fundamental concept in computation and mathematical logic. In the context of constructive mathematics, it relates to the limits of what can be effectively computed or decided by algorithms or mechanical processes. In more precise terms, Church's thesis posits that every effectively calculable function (one that can be computed by a mechanical process) is computably equivalent to a recursive function.