There was recently a claimed proof that $P \ne NP$. Not long after its publication there were raised some issues with this proof.So ... is the proof correct or not ? (Please only answer this if you have evidence ... this question might take some time until it's answered)
Is Deolalikar's 2010 proof that $P \ne NP$ correct?
np hardness;cc.complexity theory
In one word: No.It seems that there are some fatal flaws in Deolalikar's proposed proof. The real question now is if the proof has any useful ideas that can be built upon. In any case, it seems that the proof in its current form simply isn't correct, and can't be corrected either. On the other hand, Deolalikar has not given up on the proof, so I guess it's not the end of it.You can find an update here: http://rjlipton.wordpress.com/2010/08/15/the-p%E2%89%A0np-proof-is-one-week-old/