Slashdot Mirror

← Back to Stories (view on slashdot.org)

Claimed Proof That P != NP

Posted by kdawson on from the sufficiently-complex dept.

morsch writes "Researcher Vinay Deolalikar from HP Labs claims proof that P != NP. The 100-page paper has apparently not been peer-reviewed yet, so feel free to dig in and find some flaws. However, the attempt seems to be quite genuine, and Deolalikar has published papers in the same field in the past. So this may be the real thing. Given that $1M from the Millennium Prize is involved, it will certainly get enough scrutiny. Greg Baker broke the story on his blog, including the email Deolalikar sent around."

1 of 457 comments (clear)

  1. Re:Well, duh by icebike · · Score: 0, Flamebait

    I mean, NP has an N in front of the P. That's obviously not the same as P. Also, P != HP.

    If you knew really advanced mathematics you'd know that NP means N times P. So NP does equal P when N=1. But not the rest of the time. Oh and it does when P=0. How much was that prize again?

    And if you didn't know any advanced mathematics You could read the wiki page about this problem:

    http://en.wikipedia.org/wiki/P_versus_NP_problem

    However, it seems you could read that page, and still have not a single useable clue.

    --
    Sig Battery depleted. Reverting to safe mode.