A new function algebra of EXPTIME functions by safe nested recursion
classification
💻 cs.CC
keywords
recursionfunctionssafecomputablenestedalgebrabellantonicalled
read the original abstract
Bellantoni and Cook have given a function-algebra characterization of the polynomial-time computable functions via an unbounded recursion scheme which is called safe recursion. Inspired by their work, we characterize the exponential-time computable functions with the use of a safe variant of nested recursion.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.