No P = NP Proof After All

00_NOP writes "Internet commerce seems safe for now as Russian computer scientist Vladimir Romanov has conceded that his previously published solution to the '3 SAT' problem of boolean algebra does not work. If his solution did work it would have shown that many problems thought to be unsolvable with conventional computers — including decrypting your HTTPS encoded credit card number — would have been solvable in polynominal time. Romanov, who is very far from the sort of crank who normally claims to have proved P = NP or the opposite, is not giving up though..."

A better heading

[Anonymous Coward]

Proof = No Proof

Re:Let me ask a "stupid" question

[benjamindees]

Solving this problem would save energy on the hundreds of thousands of NSA computers that are currently decrypting all of your e-mail and Skype conversations.

Re:Let me ask a "stupid" question

[canajin56]

Yes. Anything but profit that doubles every quarter, forever, is a catastrophic failure.

Re:So...

[brian0918]

Next the Slashdot story will be used as a Reliable Source on Wikipedia.