A new function algebra of EXPTIME functions by safe nested recursion
计算复杂性
2008-03-05 v2
摘要
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.
关键词
引用
@article{arxiv.cs/0607118,
title = {A new function algebra of EXPTIME functions by safe nested recursion},
author = {Toshiyasu Arai and Naohi Eguchi},
journal= {arXiv preprint arXiv:cs/0607118},
year = {2008}
}