The MathResource
Church's thesis,
n. (Logic, computing) the hypothesis that a function is recursive if and only if it is effectively computable. See also Turing machine.