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

基于序终止的复杂性界

Complexity Bounds for Ordinal-Based Termination

Sylvain Schmitz

摘要:

“如果我们在一个给定的形式系统中证明了一个定理,那么除了它的真实性之外,我们还知道什么呢?我们在程序终止证明的特定背景下研究Kreisel的问题,着眼于推导程序运行时间的复杂性界限。我们的主要工具,这是长度函数定理,它提供了复杂性的界限上使用良好的准秩序。我们说明了如何证明这样的定理在简单的情况下,但到目前为止未经处理的序数。我们将展示如何应用这一新的定理来推导程序的复杂性界限时,他们被证明终止感谢到一些序数的排名功能。

英文摘要:

`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program running times. Our main tool for this are length function theorems, which provide complexity bounds on the use of well quasi orders. We illustrate how to prove such theorems in the simple yet until now untreated case of ordinals. We show how to apply this new theorem to derive complexity bounds on programs when they are proven to terminate thanks to a ranking function into some ordinal.

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

↑