Possible Issues With the P != NP Proof
An anonymous reader writes "We previously discussed news that Vinay Deolalikar, a Principal Research Scientist at HP Labs, wrote a paper that claimed to prove P is not equal to NP. Dick Lipton, a Professor of Computer Science at Georgia Tech, analyzed the idea of the proof on his blog. In a recent post, he explains that there have been many serious objections raised about the proof. The post summarizes the issues that need to be answered in any subsequent development, and additional concerns are raised in the comment section."
feel very very stupid after reading that.
Boffoonery - downloadable Comedy Benefit for Bletchley Park
Like I said last time. The trouble is, every time someone proves P=NP, the NSA arranges them a little accident.
I have discovered a truly marvelous proof that P!=NP. But this comment is too deterministic to contain it.
Minor typos like a ! that m,ade it into the paper by accident.
How cool was that, I assume it was to give you a theoretical basis for the use of car analogies.
To have a right to do a thing is not at all the same as to be right in doing it
If you think 'polynomial time' and 'quickly' are in any way similar, there's a good chance that you're a theoretical computer scientist.
I am TheRaven on Soylent News
Strictly speaking, every computer in the real world is a finite state machine that's complex enough to simulate a universal Turing machine. It's a subtle difference that really only matters if you're considering the math behind it ;)
Oh Snap!!
You're thinking small. Why miniaturize the laser, when we could instead enlarge the sharks? -John Searle
CS is a subset of biology. Any question in CS can and must be restated in a human brain...