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

如果 Turing 先于 Gödel 会怎样?

What If Turing Had Preceded Gödel?

Sebastian Oberhoff

AI总结:

本文以计算而非算术为核心重构数理逻辑,简化 Gödel 不完备性定理证明,并将其连接到 Turing 完备性、复杂性层次与预言机。

摘要:

以下各页的总体主题是:以不完备性定理为核心的数理逻辑,首先且最重要的是对 computation(计算)的研究,而不是对算术的研究。在这一直觉引导下,我们将展示以下内容。首先,我们几乎消除了对 Gödel 数的需要。接下来,我们将为可表示函数引入一种新颖的记法装置,并逐步完成一个精炼证明,说明 Peano Arithmetic(皮亚诺算术)能够表示每个可计算函数;它达到了 Turing 完备性。继续下去,我们将以显著简化的证明推导对角引理和第一不完备性定理。在处理第二不完备性定理时,我们将能够使用某些自指技巧,避免围绕它的大量技术泥潭,并得到三个独立版本。把第一不完备性定理与停机问题不可解性之间的类比加以扩展,会产生计算复杂性领域中 Nondeterministic Time Hierarchy Theorem(非确定性时间层次定理)的一个等价形式。最后,我们将通过把我们的思想与 oracle(预言机)联系起来,简要窥探不可计算的领域。

英文摘要:

The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will show the following. * First, we'll all but eliminate the need for Gödel numbers. * Next, we'll introduce a novel notational device for representable functions and walk through a condensed demonstration that Peano Arithmetic can represent every computable function. It has achieved Turing completeness. * Continuing, we'll derive the Diagonal Lemma and First Incompleteness Theorem using significantly simplified proofs. * Approaching the Second Incompleteness Theorem, we'll be able to use some self-referential trickery to avoid much of the technical morass surrounding it; arriving at three separate versions. * Extending the analogy between the First Incompleteness Theorem and the Unsolvability of the Halting Problem produces an equivalent of the Nondeterministic Time Hierarchy Theorem from the field of computational complexity. * Lastly, we'll briefly peer into the realm of the uncomputable by connecting our ideas to oracles.

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

↑