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

在不依赖相对化的条件下进行对角线化:对Baker-Gill-Solovay定理的深入探讨

Diagonalization Without Relativization A Closer Look at the Baker-Gill-Solovay Theorem

Baruch Garcia

AI总结:

本文通过半相对化方法,证明了R与RE、P与NP的分离不依赖相对化,从而绕过Baker-Gill-Solovay、代数化和自然证明三个障碍。

摘要:

我们已经知道,诸如P与EXP的不等价性以及接受问题和停机问题的不可判定性等问题都是相对化的。然而,相对化是一种有限的工具,无法区分其他复杂性类。尚未明确证明的是,接受问题的图灵可识别性是否相对化。我们将考虑一个 oracle,使得 R 和 RE 相等;RA = REA,其中 A 是 ALL 类中等价问题的 oracle,但不在 RE 或 co-RE 中。然后我们将区分相对化和我们称之为“半相对化”的概念,即仅使用接受问题 oracle 来分离类。我们主张 R 与 RE 的分离是一个仅由“半相对化”证明的事实。然后我们将“缩小”到 R 和 RE 的多项式类比,以绕过 Baker-Gill-Solovay 障碍,使用“半相对化的”对角线化,注意对角线化与相对化之间的细微差别。然后这个“多项式接受问题”可以归约到 CIRCUIT-SAT 和 3-CNF-SAT,证明这些问题在多项式时间内不可判定但可多项式时间验证。“半相对化”不使用算术化来绕过相对化障碍,因此本身也绕过了 Aaronson 和 Wigderson 的代数化障碍。最后,由于半相对化是一种非构造性技术,Razborov 和 Rudich 的自然证明障碍也被绕过。因此,R 与 RE 以及 P 与 NP 的分离都不相对化,但都“半相对化”,绕过了所有三个障碍。

英文摘要:

We already know that several problems like the inequivalence of P and EXP as well as the undecidability of the acceptance problem and halting problem relativize. However, relativization is a limited tool which cannot separate other complexity classes. What has not been proven explicitly is whether the Turing-recognizability of the acceptance problem relativizes. We will consider an oracle for which R and RE are equivalent; RA = REA, where A is an oracle for the equivalence problem in the class ALL, but not in RE nor co-RE. We will then differentiate between relativization and what we will call "semi-relativization", i.e., separating classes using only the acceptance problem oracle. We argue the separation of R and RE is a fact that only "semi-relativization" proves. We will then "scale down" to the polynomial analog of R and RE, to evade the Baker-Gill-Solovay barrier using "semi-relativized" diagonalization, noting this subtle distinction between diagonalization and relativization. This "polynomial acceptance problem" is then reducible to CIRCUIT-SAT and 3-CNF-SAT proving that these problems are undecidable in polynomial time yet verifiable in polynomial time. "Semi-relativization" does not employ arithmetization to evade the relativization barrier, and so itself evades the algebrization barrier of Aaronson and Wigderson. Finally, since semi-relativization is a non-constructive technique, the natural proofs barrier of Razborov and Rudich is evaded. Thus the separation of R and RE as well as P and NP both do not relativize but do "semi-relativize", evading all three barriers.

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

↑