News for hackers. Stuff that matters.
Re:Major (unfixable) flaw found in P!=NP paper. by akshayubhat on Tuesday August 10, 2010 @05:01PM (#1592946)
here is the deal, it is extremely difficult to prove P ?= NP. However it is comparatively easier to have a wrong proof.

The only thing that you can say is that this approach was one of the trickier ones to do it in a wrong way.

Yet it does not "necessarily" means that this approach is actually a starting point.

Just it seems to be more complex than the other approaches.

Re:Major (unfixable) flaw found in P!=NP paper. by JadeNB on Wednesday August 11, 2010 @01:40AM (#1593942)
> The only thing that you can say is that this approach was one of the trickier ones to do it in a wrong way.

Or, rather, that someone (well qualified) thinks it was. I am very sceptical of a refutation based on the assumption that the proof founders on a beginner's mistake; it's not impossible, but, if Deolalikar is a beginner in the relevant field (I have no idea!), then it seems very likely that he would have consulted with someone who wasn't to avoid such trip-ups.

> Yet it does not "necessarily" means that this approach is actually a starting point.

I am a mathematician, not a computer scientist; but I think it's safe to say that any approach to a well known problem that is not (1) immediately dismissible (by experts) as crackpottery or (2) a laborious advance an inch down a familiar road of reasoning is likely to represent a promising starting point for something (future research in general, if not the answer to the specific question). If it is (3) described by experts as a novel and/or unexpected approach, as I think that this paper was, then that likelihood becomes a near-certainty.