arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.2410cs.CCcs.LO
收藏

关于分层小跳算子

On tiered small jump operators

Jean-Yves Marion

摘要:

递归模式的预测分析是一种描述复杂性类的方法,比如多项式时间可计算函数的FPTIME类。这种分析来自Bellantoni和Cook的作品,以及Leivant的数据分层。在这里,我们完善预测分析,通过使用一个分歧阿克曼的建设一个非原始递归函数。我们得到了一个层次的功能,它的特点正是功能,这是在O(n^k)的时间内计算的寄存器机器模型的计算。为此,我们引入一个严格的分歧原则。然后,我们展示了如何对角化,以获得一个指数函数,并跳出确定性多项式时间。最后,我们提出了一个依赖的类型化的微积分来表示这种结构。

英文摘要:

Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering. Here, we refine predicative analysis by using a ramified Ackermann's construction of a non-primitive recursive function. We obtain a hierarchy of functions which characterizes exactly functions, which are computed in O(n^k) time over register machine model of computation. For this, we introduce a strict ramification principle. Then, we show how to diagonalize in order to obtain an exponential function and to jump outside deterministic polynomial time. Lastly, we suggest a dependent typed lambda-calculus to represent this construction.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑