It is not the case that Church's Thesis entails that any function intuitively computable by a finite procedure is computable by a Turing Machine, regardless of definitional form.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.