Two theorems about the P versus NP problem

Por • 21 may, 2018 • Sección: Opinion

Tianheng Tsui

Abstract: Two theorems about the P versus NP problem be proved in this article (1) There exists a language L  , that the statement LP  is independent of ZFC. (2) There exists a language LNP  , for any polynomial time deterministic Turing machine M  , we cannot prove L  is decidable on M  .

arXiv:1805.01755v1 [cs.CC]

Computational Complexity (cs.CC); Logic (math.LO)

Post to Twitter

Escribe un comentario