arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.07406cs.CC
收藏

关于非确定性复杂度及相关类的正式不可判定命题

On Formally Undecidable Propositions of Nondeterministic Complexity and Related Classes

Martin Kolář

AI总结:

本文探讨了NP类中存在某些语言的性质,其定义与哥德尔不完备定理相冲突,指出NP的语义定义不可满足。

摘要:

NP的定义要求每个成员语言L有一个多项式时间检查关系R和常数k,使得w∈L当且仅当存在y(|y|≤|w|^k且R(w,y))。本文证明该双条件实例化了希尔伯特的三元组:一个声名、完整、可判定的证明系统,其中L中的真值和有界可证明性通过法令相吻合。进一步证明多项式时间限制在R上并不排除哥德尔的证明检查关系,该关系本身是多项式时间的,并符合定义作为字面实例。因此,将NP视为所有多项式时间R的总和,包含了一些语言,其双条件断言了哥德尔第一不完全定理所禁止的属性。NP的语义定义不可满足,原因与希尔伯特计划相同。

英文摘要:

The definition of \NP\ requires, for each member language~$L$, a polynomial-time checking relation~$R$ and a constant~$k$ such that $w \in L \iff \exists y\,(|y| \leq |w|^k \wedge R(w,y))$. We show that this biconditional instantiates, for each member language, Hilbert's triple: a sound, complete, decidable proof system in which truth-in-$L$ and bounded provability coincide by fiat. We show further that the polynomial-time restriction on~$R$ does not exclude Gödel's proof-checking relation, which is itself polynomial-time and fits the definition as a literal instance. Hence \NP, taken as a totality over all polynomial-time~$R$, contains languages for which the biconditional asserts a property that Gödel's First Incompleteness Theorem prohibits. The semantic definition of \NP\ is unsatisfiable, for the same reason that Hilbert's Program is.

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

↑