Tag Archives: proof

P != NP solved?

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:

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)

Sadly my wishes didn’t help :-/