# Two theorems about the P versus NP problem

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.

READ FULL TEXT