Vinay Deolalikar is standing by his {\mathsf{P} \neq \mathsf{NP}} claim and proof. He and I have been exchanging e-mails, and as noted in the. Possible fatal flaws in the finite model part of Deolalikar’s proof Neil Immerman is one of the world’s experts on Finite Model Theory. He used. An update on the P not equal to NP proof Timothy Gowers, Gil Kalai, Ken Regan, Terence Tao, and Suresh Venkatasubramanian are some of.

Author: Moll Vishicage
Country: Uzbekistan
Language: English (Spanish)
Genre: Business
Published (Last): 24 April 2018
Pages: 86
PDF File Size: 10.44 Mb
ePub File Size: 17.78 Mb
ISBN: 389-8-83496-495-6
Downloads: 90510
Price: Free* [*Free Regsitration Required]
Uploader: Faut

Deolalikar Responds To Issues About His P≠NP Proof

This is synergy, is it not? Polynomial algorithms cannot generate such and such family of distributions and make this statement precise.

But what if we generalize this notion of the complexity of parametrizing solution space? Many parameters required to describe the space.

Inasmuch as the mathematician operates with his conceptions along strict and formal lines, he, above all, must be reminded from time to time that the origin of things lie in greater depths than those to which his methods enable him to descend. He refuses to do that, and blames other referees who let people get away with that, as well as authors trying to expedite publication by letting the referee do the most unpleasant part of the job.

However, the claim made by Vinay is quite concrete: Someone stranded atop a mountain is in mortal risk and it is ethically imperative for rescuers to make an effort to reach him. I see a potential problem with c d when you use projections. More precisely, can we get a nice characterization, using finite model theory?

You force not to give hard problem instances in some sense. I think I learned three things: Thinking about this paper may have slightly melted my brain. So, the question is deolali,ar if this paper has any chance of being fixed.

Fatal Flaws in Deolalikar’s Proof? | Gödel’s Lost Letter and P=NP

Then, a UTC is described by a tree: Somehow this particular paper spread very rapidly. It is not hard to check that both the lack n rigorous definitions and the specific model theory flaws were pointed out very early on. However, all known algorithms for finding solutions take, for difficult examples, time that grows exponentially as the grid gets bigger.

The blogs need to set an expectation of the time line of his response and take a break to re-convene later.


math – Explain the proof by Vinay Deolalikar that P != NP – Stack Overflow

The current publication practices in TCS in my opinion falls short in this regard, and there seems to be no consensus in the TCS community how to remedy the situation despite periodic attempts by various people to raise this issue — for example, Neal Koblitz in the AMS notices a couple of years ago.

They can convince skeptical people like me to see that there is at least some real meat in this paper. In particular, the projected distribution is not in a recursively factorizable form, and the cluster geometry of the lifted solution space could be quite different from that of the original k-SAT problem e.

Of course, one can forget all but the original n variables and return to a distribution on the solution space by projecting, but it is not clear that the polylog parameterizable property is preserved by this there is no reason why the directed acyclic graph on the N literals has any meaningful projection onto the original n literals.

Email required Address never made public. Although I am not aware of any algorithm that corrects up to half the GV distance even close to it. He and I have been exchanging e-mails, and as noted in the several comments, he has updated his paper several times. Does Deolalikar need to make a claim about the former computation to get what he needs for the latter computation? I think we all should thank you, Richard, for your enthusiasm in updating this blog, and your providing food for thought and a space for discussion.

Bringing this to the matter at hand, I am under the impression that many people do not have a clear idea of what a completely detailed proof is, and rely on some sort of general intuition — which is required to come up with just about any serious proof in any form — even for proofs for publication.

So basically de Branges was inadvertently doing everything he could to alienate people. Is it really true that 1 is relatively uncontroversial? If the problem is NP -complete, the polynomial time hierarchy will collapse to its first level i.

They cannot be completely solved by any algorithm, in the sense that for any particular algorithm there is at least one input for which that algorithm will not produce the right answer; it will either produce the wrong answer, finish without giving a conclusive answer, or otherwise run forever without producing any answer at all.


At each stage, the successor distance is doubled, so in stages we have the whole ordering. However, the converse is not necessarily true.

Update on Deolalikar’s Proof that P≠NP

The feolalikar is being discussed further here: Open Problems Of course the key questions remain: My current take is that there is a big missing piece: In his new survey of the proof, he promises a proof that exponential number of parameters is needed in the hard phase in his new draft.

Create a free website or blog at WordPress. Oxford Lecture Series in Mathematics and its Applications. But I now realize that even people sitting high up in US universities are too strait-jacketed to do deolaalikar.

Retrieved 26 September Grisha was a top researcher and did never hand wave. Just counting the number of copy-pasted parts of posts here shows the advantage of being able to reply inline.

I also do not think that the mp is a serious attempt. Of course, any new material deolalikad be sourced whenever possible, and remain constructive and objectively neutral; in particular, personal subjective opinions or speculations are to be avoided.

But it is not hard to tinker with the problem a bit deolalikr to fix this also. In this theory, the class P consists of all those decision problems defined below that can be solved on a deterministic sequential machine in an amount of time that is polynomial in the size of the input; the class NP consists of all those decision problems whose positive deolxlikar can be verified in polynomial time given the right information, or equivalently, whose solution can be found in polynomial time on a non-deterministic machine.

As a separate point, note that if his proof, if correct, shows that there is a poly-time samplable distribution on which k-SAT is hard on average — that hard instances are easy to generate.

That makes some sense. Excerpted from this comment of Ken Regan. Many thought V Vinay has taken permanent recluse from complexity theory. I am not sure if it is open to public.

I can say because of his teaching i have become a great programmer! I am planning for the future. But that definitely does not imply that each stage deolakikar the induction is order independent.