In essence, the P = NP problem can be restated as the following question:
Suppose that solutions to a problem can be verified quickly. Then, can the solutions themselves also be computed quickly?
— Wikipedia on P versus NP problem
— 17:14, 31 July 2011
If the question of whether P=NP were to be answered affirmatively[,] it would trivialize the rest of the Millennium Prize Problems (and indeed all but the unprovable propositions in mathematics) because they would all have direct solutions easily solvable by a formal system.
2013.07.04 Thursday ACHK