A new function algebra of EXPTIME functions by safe nested recursion

Details A new function algebra of EXPTIME functions by safe nested recursion A new function algebra of EXPTIME functions by safe nested recursion

2006-07-27

arxiv.org/abs/cs/0607118v2

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A new function algebra of EXPTIME functions by safe nested recursion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new function algebra of EXPTIME functions by safe nested recursion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new function algebra of EXPTIME functions by safe nested recursion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-250121