Two theorems about the P versus NP problem
Computational Complexity
2018-05-09 v1 Logic
Abstract
Two theorems about the P versus NP problem be proved in this article (1) There exists a language , that the statement is independent of ZFC. (2) There exists a language , for any polynomial time deterministic Turing machine , we cannot prove is decidable on .
Cite
@article{arxiv.1805.01755,
title = {Two theorems about the P versus NP problem},
author = {Tianheng Tsui},
journal= {arXiv preprint arXiv:1805.01755},
year = {2018}
}