It is not the case that Church's Thesis claims all intuitively computable functions are Turing-computable; primitive recursion exemplifies intuitive computability.
?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.