This is my thing of the day, but I think it deserves a thread of it's own!
P != NPIf proven correct (and usually there are only minor flaws found in the peer review), this spells good news for crypto and even better news for quantum computing research funding.
Comments
http://rjlipton.wordpress.com/2010/08/09/issues-in-the-proof-that-p%E2%89%A0np/#comment-4712
Also, if this guy is right, then he should mail his money to the Russian guy who refused the prize. For awesomeness.
One has to realize that mathematical notation is very dense and that a proof 100 pages long has at least that many intermediary steps, invocations of lemma's, sub-results, etc. etc.. Other persons reading the proof cursorily can find several "wonky" steps or holes in the proof without this being a problem because either a) the procedure of that step can be easily improved, or b) the reader didn't entirely understand the authors intent at that step (and the wonkyness is taken care of elsewhere in the paper in a non obvious way).
Think of a mathematical proof as a computer program that you can only check for correctness by reading the code. No compiling and running to see if it crashes. Take the Poincare conjecture that Perelman solved; the proof was some 68 pages all together and it took two separate ~500 page reports to validate the proof.
All this being said, it is of course possible that the author made an easy to spot fatal error, but until such error(s) are published or the author retracts his paper, I'm cheering for the guy. Seeing problems of this caliber fall is very exciting to me, and at the rate they are going I may very well live to see the list depleted.
From the above link (emphasis mine) The discrepancy between the attention span of the media and the time it takes to scientifically vet something is why we have "electricity allergy", power lines that cause cancer, cell phones that do the same, and vaccines that cause autism.
Granted, P==NP is no match for 8==D.