This debate has gone on for way too long. There are many fantastic explanations of the P=NP problem all over the internet that I will refer readers who are not familiar with this problem to since I cannot give the description of the problem adequate justice. In summary it is a straightforward computer science/math problem that is basically asking if it is possible to find a way to solve problems that takes as much time as checking if their solutions are correct. The problem has been so deeply abstracted at this point that a solution to it would apply to nearly everything. Folks normally discuss this in the abstract sense as an electrical circuit and look for solutions to this problem on an electrical circuit; the idea being that anything that can be done with an electrical circuit will immediately benefit from such a solution (I.E. nearly all knowledge work).
While I would love to dazzle you with my mediocre Boolean algebra and the conclusions I find satisfying to prove that P != NP therein, I would instead like to appeal to an even simpler statement. The P=NP problem as we understand it was formalized between the late 1950’s and the early 1970’s. At a minimum, humanity has been working on this problem directly for 50+ years. How do we know if we have found a proof to support P=NP? There are a few Boolean algebra problems that can be used to test such a solution out. Thus, with our search for a solution to this problem taking 50+ years, and our ability to prove a solution to it rather quickly, I would say is enough proof that P != NP.
#tech
mitch.tech 