Well, it happens every now and then, that someone finds a proof for a long standing theoretical problem.
This time it’s the famous P = NP or P != NP problem of computer science that Gecko pointed me to:
- P != NP, the proof (yet to be accepted) (Updated on Aug. 10th)
- Index page, seems there were some updates (added on Aug. 11th)
- (Another mirror)
- Vinay Deolalikar in Wikipedia (as always Wikipedia folks want to delete ;))
- Heise News (thx Simon) (added on Aug. 9th)
Let’s wish him luck that his proof is flawless and accepted.
(Who’s the first one to say: “I’ve always known it” ? :D)
- First summary of some issues (added on Aug. 10th)
- A List of other attempts to solve PNP (thx Harald) (added on Aug. 11th)
- Bruce Schneier bets the proof is flawed 😉 (added on Aug. 11th)
- Easy xkcd explanation of NP-Completeness (added on Aug. 11th)
- Wikipedia on P versus NP with ref to fatal flaws of Deolalikars proof. (added on Aug. 20th)
Sadly my wishes didn’t help :-/