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..."

Comments

Let me ask a "stupid" question

[bogaboga]

How does the solving of problems like these really help the world? I would like a sincere 'down-to-earth' answer that my 89 year old grandfather can understand and therefore be in position to donate to the effort of solving such problems.

Thanks.

Re:Let me ask a "stupid" question

[Dunbal]

Need proof that faster is better? Look at your computer. Now, Look at the computers of the 1960s. See?

Look at computers in the 1960's. Look at economic growth in the 1960's. Look at computers today. Look at economic growth today. See? It's not as clear cut as you would like to it be. Especially when you don't define "better". Faster computers are FASTER. Period.