Claimed Proof That P != NP
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."
Bet he got here on an H1-B; let's get rid of him!
P.S. On an H1-B here myself; pissed off at all the hatred.
Just gonna moan about your sig, sorry. If by definition, one language is simpler, more elegant, faster yet also slightly more high level, terser, yet more powerful than another programming language, that would make it 'better' than another language given all else equal. If we accept that a language could be slightly better than another language then it stands to reason that a language could be *much* better (or indeed, much worse).
I don't really currently like or hate any language (I use c/c++ mostly, if only for the speed) as they all have their glaring faults. But in theory, and maybe in practise within 100 years, a language will be so good that it deserves to be loved, and yes, loved more so than other languages.
Why OpalCalc is the best Windows calc
but my point being, very very few people are qualified to write or debunk this paper, but everybody should be trying to.
s/paper/AGW and you would have been modded into oblivion for heresy against the academe. We have a peer review process, how dare mere serfs challenge our great wisdom.