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

计算下界的资源有界不可证明性

Resource Bounded Unprovability of Computational Lower Bounds

Tatsuaki Okamoto, Ryo Kashima

摘要:

本文介绍了算术形式理论(包括PA(Peano Arithmetic))的渐近证明、PT(polynomial-time)-扩张、PTM(polynomial-time图灵机)-Ω-相容性等新概念。本文证明了Pnot = NP(更一般地说,PSPACE中的任何超多项式时间下界)在PTM-Ω-相容理论T中是不可证明的,其中T是PA的相容PT-扩张.该结果通过对PTM-欧米茄-一致性的两种刻画方式,统一了现有的证明P not= NP的两个主要否定结果:自然证明和相对化证明。我们还证明了T的PTM-Ω-相容性不能在任何PTM-Ω-相容理论S中得到证明,其中S是T的相容PT-扩张。

英文摘要:

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P not= NP (more generally, any super-polynomial-time lower bound in PSPACE) is unprovable in a PTM-omega-consistent theory T, where T is a consistent PT-extension of PA. This result gives a unified view to the existing two major negative results on proving P not= NP, Natural Proofs and relativizable proofs, through the two manners of characterization of PTM-omega-consistency. We also show that the PTM-omega-consistency of T cannot be proven in any PTM-omega-consistent theory S, where S is a consistent PT-extension of T.

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

↑