可行深度
Feasible Depth
摘要：
本文介绍了Bennett逻辑深度的两种复杂性理论公式：有限状态深度和多项式时间深度。结果表明，对于这两种配方，平凡和随机的无限序列是浅的，和一个缓慢的增长规律，这意味着深序列不能很容易地创建从浅序列。此外，E模拟的停机语言被证明是多项式时间深，通过证明一个更一般的结果：每一个语言的一个不可忽略的子集E可以减少在统一的指数时间是多项式时间深。
英文摘要：
This paper introduces two complexity-theoretic formulations of Bennett's logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow growth law holds, implying that deep sequences cannot be created easily from shallow sequences. Furthermore, the E analogue of the halting language is shown to be polynomial-time deep, by proving a more general result: every language to which a nonnegligible subset of E can be reduced in uniform exponential time is polynomial-time deep.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
