Search

Vinay Deolalikar purporting to show that P! = NP

Posted by on Aug 09, 2010 | Leave a Comment

Vinay Deolalikar purporting to show that P! = NPHewlett-Packard Research Laboratory researcher Vinay Deolalikar purporting to show that P! = NP . Vinay Deolalikar  is a researcher who works for HP, and had this test in secret during the years he has developed: even today has only been known by a leak of some of the people which has been instructed to ask their opinion.

P / NP problem involves the complexity of the relationship between class P and NP, P is in fact a subset of NP, NP is non-deterministic Turing machine in polynomial time computation of the problem, P is deterministic Turing machine in polynomial time to solve the problem. P is equal to NP is the Clay Mathematics Institute’s Millennium Prize Problems of. Deolalikar paper up to 100 pages , have not yet been peer-reviewed, so anyone can find flaws in the paper or errors. If Deolalikar proof is correct, then he will be eligible for millions of dollars in prize money offered by Cray.

Deolalikar attached below the message content:

Dear Fellow Researchers, Dear Fellow Researchers,

I am pleased to announce a proof that P is not equal to NP,which is attached in 10pt and 12pt fonts. I am pleased to announce a proof that P is not equal to NP, which is attached in 10pt and 12pt fonts.

The proof required the piecing together of principles from multiple areas within mathematics. The major effort in constructing this proof was uncovering a chain of conceptual links between various fields and viewing them through a common lens. Second to this were the technical hurdles faced at each stage in the proof. The proof required the piecing together of principles from multiple areas within mathematics. The major effort in constructing this proof was uncovering a chain of conceptual links between various fields and viewing them through a common lens. Second to this were the technical hurdles faced at each stage in the proof.

This work builds upon fundamental contributions many esteemed researchers have made to their fields. In the presentation of this paper, it was my intention to provide the reader with an understanding of the global framework for this proof. Technical and computational details within chapters were minimized as much as possible. This work builds upon fundamental contributions many esteemed researchers have made to their fields. In the presentation of this paper, it was my intention to provide the reader with an understanding of the global framework for this proof. Technical and computational details within chapters were minimized as much as possible.

This work was pursued independently of my duties as a HP Labs researcher, and without the knowledge of others. I made several unsuccessful attempts these past two years trying other combinations of ideas before I began this work. This work was pursued independently of my duties as a HP Labs researcher, and without the knowledge of others. I made several unsuccessful attempts these past two years trying other combinations of ideas before I began this work.

Comments and suggestions for improvements to the paper are highly welcomed.

The paper, 100 pages by the way, supposedly proves relating multiple concepts from several areas of mathematics, that P \ = NP.  The researcher claims to have proved that P! = NP, but is under review.  It should not be rushed. Still can not be considered valid.


Leave a comment