questfortruth
Well-Known Member
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.
I argue, while dwelling on the proofs, that the solution
to some most complicated problems or tasks
can be just a sentence or two. And if so, then the P=NP
Millennium Prize Problem has to be true.
For my understanding, it has to be P=NP because there is a
being (or are beings), who know not only all knowledge discovered so far but
the hidden knowledge as well. All-knowing one would know about own
existence as well. Hence, he does exist. If you know everything, including
that you exist, then you exist. Because Your existence is part of knowledge.
If something sounds very incomprehensible and stupid, then it is either
brilliant or insane. None of the three laws of Aristotle's Logic is violated.
DOI: 10.13140/RG.2.2.16148.83843
I argue, while dwelling on the proofs, that the solution
to some most complicated problems or tasks
can be just a sentence or two. And if so, then the P=NP
Millennium Prize Problem has to be true.
For my understanding, it has to be P=NP because there is a
being (or are beings), who know not only all knowledge discovered so far but
the hidden knowledge as well. All-knowing one would know about own
existence as well. Hence, he does exist. If you know everything, including
that you exist, then you exist. Because Your existence is part of knowledge.
If something sounds very incomprehensible and stupid, then it is either
brilliant or insane. None of the three laws of Aristotle's Logic is violated.
DOI: 10.13140/RG.2.2.16148.83843
Last edited: