A "Proof" of $P\neq NP$
Computational Complexity
2021-10-15 v9
Abstract
This short note present a "proof" of . The "proof" with double quotation marks is to indicate that we do not know whether the proof is correct or not (We're confused because we do know in which we make the mistakes).
Cite
@article{arxiv.2003.09791,
title = {A "Proof" of $P\neq NP$},
author = {Tianrong Lin},
journal= {arXiv preprint arXiv:2003.09791},
year = {2021}
}
Comments
Withdrawn, since $\mathbb{N}\subseteq S$ and the mathmaticans do not acknowledge that $\mathbb{N}$ is bounded from above which is very crucial. See arXiv:2110.06211