Two theorems about the P versus NP problem
Abstract
Two theorems about the P versus NP problem be proved in this article (1) There exists a language L, that the statement L ∈ P is independent of ZFC. (2) There exists a language L ∈ NP, for any polynomial time deterministic Turing machine M, we cannot prove L is decidable on M.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.