News for hackers. Stuff that matters.
Re:P≠NP proof update by philwelch on Sunday August 15, 2010 @08:23PM (#1606355)
Cryptography is a perverse example where you want to create very hard problems (if not impossible) for others to solve while having some means of keeping the problem easy for yourself and individuals you trust.

If we had some easy way to solve problems in NP though, I bet there would be tons of productive applications. I'll quote a friend of mine:

"That would transform life on earth, and multiply our technological development rate by a factor unimaginable.

There's no way of even estimating what could happen if that problem were solved, unless the polynomial conversion made the problem impossible.

....It would also solve the protein-folding problem and all of the quantum state problems. Money is nifty; immortality and a possible stardrive don't suck. The NP problem is the current barrier to human science. 'There's no way to simulate that' is a constant refrain around here."

An interesting way of looking at it is that a valid proof that P != NP would be a kick in humanity's balls comparable to Gödel's incompleteness theorem.

Re:P≠NP proof update by eru on Sunday August 15, 2010 @09:48PM (#1606526)
Only that most people already expect P != NP.

But as you say, P = NP would really make things too easy.