It is not the case that Some primitive recursive functions are not efficiently Turing-computable in practice, challenging the functional equivalence claim.
?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.