RSS

Category Archives: complexity

A Concise Solution to the P=NP? Problem

To solve P=NP? is to answer the following question:

Can we solve strictly more problems with a computer that does not exist?

Thus we have proved that this problem is nonsense. QED.

Seriously, this blog took me years to conceive, and a week to write. Please don’t take it lightly. If you need a more “authoritative” proof, please refer to this.

Advertisements
 
Comments Off on A Concise Solution to the P=NP? Problem

Posted by on March 27, 2013 in algorithms, complexity