It is not the case that The claim conflates 'paradigm case of finite procedure' with 'provably equivalent to Turing computability'—distinct logical steps.
?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.