It is not the case that Cobham's original characterization of feasibility via limited recursion on notation tacitly assumes sequential computation, excluding parallel models where the bound fails to generalize.
?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.