Cobham's original characterization of feasibility via limited recursion on notation tacitly assumes sequential computation, excluding parallel models where the bound fails to generalize.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.
A mathematical or computational rule that allows a process to call itself, but only in restricted ways to avoid infinite loops or complexity.
Parallel models(as an alternative to sequential computation)
Ways of running calculations where many instructions are executed simultaneously at the same time, rather than one after another.
Sequential computation(as the assumed computation model)
A way of running calculations where the computer performs one instruction after another, one at a time, in order.
notation(Syntactical and semantic foundation for symbol systems)
A symbol system in which each symbol corresponds to exactly one item in the realm, and each item in the realm corresponds to exactly one symbol in the system.