Every effectively calculable function is computable by a Turing machine; equivalently, the class of intuitively 'computable' functions coincides with the λ-definable / general recursive / Turing-computable functions.
Every effectively calculable function is computable by a Turing machine; equivalently, the class of intuitively 'computable' functions coincides with the λ-definable / general recursive / Turing-computable functions.