Now, Vinay Deolalikar, well-known researcher in the networks and the theory of complexity of HP Labs, has prepared a document which states that to prove P is not equal to NP. If no other solution to this problem is big news because it is one of the Millennium Award and, consequently, the problems associated with the 1000000 dollar prize for the person who solves this problem.
Deolaliker worked on this issue in his spare time, and when he finally made his "breakthrough", he sent the document as an e-mail to many different "leading scientists in various fields. The news was made public in an informal blog, and this document was published on the Internet, apparently not knowing in Deolalikar. You can read the article on the link below.
Of course, most scientists, the computer has long been believed that NP differs from P - it only seems reasonable that this should be so. Nevertheless, the last long "beliefs" were abolished, when real evidence was found and it was so, and perhaps still, the nagging doubt that the NP and P may be the same. If this were so, then the consequences could be serious, since most codes based on this distinction.
The current status of the document can not be resolved - is proof, or it contains an error. Typically this problem is solved by a comparative analysis, and it may take some time. Internet accelerated things, but also made it more difficult to understand, when erroneous, or even abnormal, the evidence is presented as a solution to some prestigious problems.
In this case the author has the appropriate experience. Along with other researchers, he proved that P was less than the NP for infinite time Turing machine. This reduces the likelihood that the document is false, but it will still be some time before the final verdict is reached.
The most reliable academic discussion document can be found on the blog Professor Richard Lipton, a proof that P is not equal to NP?
Deolaliker indicates that the final document will be posted on its website during the week.
0 comments:
Post a Comment