A few episodes back in Wednesday Math, I reported on a soon to be published proof that was supposed to answer once and for all whether the problems in the set P had any overlap with the seemingly tougher problems in the set NP. Vinay Deolalaikar said he had proved they had no overlap, but his proof was found to have a few glitches in it.
I hope he didn't start spending the million dollar prize he would have pocketed if his work had been right, because that would be embarrassing.
The search continues.
Tidak ada komentar:
Posting Komentar