Affiliation:
1. Kobe University, Kobe, Japan
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference8 articles.
1. Bellantoni S. 1992. Predicative recursion and computational complexity. Ph.D. thesis University of Toronto. Bellantoni S. 1992. Predicative recursion and computational complexity. Ph.D. thesis University of Toronto.
2. A new recursion-theoretic characterization of the polytime functions
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献