论文信息 - A new function algebra of EXPTIME functions by safe nested recursion

A new function algebra of EXPTIME functions by safe nested recursion

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.

Toshiyasu Arai | Naohi Eguchi | T. Arai | N. Eguchi

[1] Stephen A. Cook,et al. A new recursion-theoretic characterization of the polytime functions , 1992, STOC '92.

[2] Peter Clote,et al. Computational Models and Function Algebras , 1994, LCC.

[3] Yehoshua Bar-Hillel,et al. The Intrinsic Computational Difficulty of Functions , 1969 .

[4] H. E. Rose. Subrecursion: Functions and Hierarchies , 1984 .

[5] Peter Clote. A Safe Recursion Scheme for Exponential Time , 1997, LFCS.

[6] Peter Clote,et al. Computation Models and Function Algebras , 1999, Handbook of Computability Theory.

[7] S. Bellantoni,et al. Predicative recursion and computational complexity , 1992 .

[8] Robert W. Ritchie,et al. CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .

[9] W. G. Handley,et al. Complexity of Primitive Recursion , 1999 .