|riider: That's what I thought at first, but it's actually more complicated than that. Good guess though. It basically means that if a computer that is given a problem that can be verified quickly in polynomial time, it can also solve it quickly in polynomial time. Anyone who proves that P is, or is not equal to NP, is awarded a million dollars. Computers and math are addicting....|
"If P = NP, then the world would be a profoundly different place than we usually assume it to be. There would be no special value in "creative leaps," no fundamental gap between solving a problem and recognizing the solution once it's found. Everyone who could appreciate a symphony would be Mozart; everyone who could follow a step-by-step argument would be Gauss..."