Mathematician Who Claimed 'P Is Not Equal To NP' Says His Proof Is Wrong (arxiv.org)
Earlier this month, Norbert Blum, a German mathematician, had published a research paper in which he implied that P is not equal to NP. The abstract of the post read: Berg and Ulfberg and Amano and Maruoka have used CNF-DNF-approximators to prove exponential lower bounds for the monotone network complexity of the clique function and of Andreev's function. We show that these approximators can be used to prove the same lower bound for their non-monotone network complexity. This implies P not equal NP. Since the publication of that paper, several mathematicians have raised concerns with Blum's methodology, with some saying that there are flaws in it. Blum has now updated the research paper to add: The proof is wrong. I shall elaborate precisely what the mistake is. For doing this, I need some time.
Only if N = 1
It's refreshing to see people who will readily admit when they're wrong, since they're looking for the truth, not to prove a point.
That's always what I fall back two when people compare science to a religion: religion relies on faith - sticking to your beliefs no matter the evidence presented. Science will readily toss out everything they know and start over if something is proven to be wrong.
"People who think they know everything are very annoying to those of us who do."-Mark Twain
Once the debate is solved will anything change?
Only if the solution shows that P = NP.
Maybe in a very academic sense, but practically speaking P != NP is overwhelmingly assumed to be the case, even if not proven. A valid proof of that being the case would be some buzz in the academics of math, but the rest of the world would shrug and move on.
XML is like violence. If it doesn't solve the problem, use more.
Unfortunately, my proof cannot fit in the margins of this post.
It may look like I'm doing nothing, but I'm actively waiting for my problems to go away.
--Scott Adams
seriously, I expect better.
You must be new here.
No sig today...