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.
Seriously. This debate always comes up. Does it have a practical purpose? Once the debate is solved will anything change?
Some analysis looks to open doors and our minds to new paths. Some looks to validate whether or not we should close doors and move on.
I am but a layman, but my understanding of P vs. NP targets the latter, not the former. Being efficient in our thinking always has value. Thinking you're traveling down a a dead end road vs. knowing you are, tends to steer efficiency.
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.
Only for NP-complete problems.
They haven't been proven to be NP-complete. There are certainly in NP.
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...
And fail. High-exponent polynomials blow up similarly fast in practice, i.e. things become infeasible at very small sizes for worst-case scenarios. Incidentally, I know pretty much what I am talking about, including, for example, in crypto. The one-way function definition, for example, that stipulates P in one direction and NP for the reversal is simply broken and comes from theoreticians that have no insight into practice. It can be fixed (sort of), but you can do perfectly secure one-way functions using P only. Hence while you may have understood some of the math, you have failed to grasp what it means in reality.
Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
Einstein was criticized for sticking to his crackpot "general" theories in later life and not jumping onto the quantum bandwagon he himself had originally piloted out of the shuttle bay. But ask yourself this: did the world actually need Einstein working on quantum physics, or were all the other brilliant people involved more than sufficient?
If the stubborn Einstein had not persisted down his stubborn path, would we now be collectively guessing what might have been in the one and only Einstein had not nestled himself in the cockpit of the alien wormhole shuttle to unimagined physics?
Instead of yammering on about this old arrogance morality tale (oh, tiresome prose!) how about bringing some actual cost/benefit to the table?
____
You know, in that horrible movie, The Hobbit, I wasn't going to believe they couldn't open that stone door until there was 14 skeletons lying beneath it. If you're going to rattle the handle to the dragon's lair, the least you can do is stick to your guns (and your magic moon map).
_____
For anyone interested the sociology of science, or the immensity of planet earth itself, or just in it for some mind-blowing pictures, I can't recommend the following article strongly enough:
Formed by Megafloods, This Place Fooled Scientists for Decades — 9 March 2017
I often visited Drumheller and the surrounding badlands in my childhood. Amazing place. Never been to Spokane, but it's not that far away.
____
Grow up. Stubbornness is a virtue every damn time stubbornness works.
The exceptions are so rare, Herzog made a movie about it, with the entire cast in character the whole wretched time.
Aguirre, the Wrath of God
retracting his proof this quickly and acknowledging error takes fortitude and a type of perseverance not often seen.
Bravo in the attempt
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.
A proof of P=NP, however, would be earthshaking well outside of academia. A constructive proof of P=NP, meaning a proof that contains a recipe for converting an NP problem into a P problem, could well be the single most important mathematical proof of all time, in terms of what it would enable people to do.
Actually, it's the very momentous impact of such a proof that makes everyone assume that P != NP. It's an intuition that the universe just isn't that nice, that there just have to be plenty of incredibly hard problems. Of course, there are problems that are harder than anything in NP, the NEXPTIME problems and, of course, the undecidable problems, so even if N = NP we'll still know we can't solve everything.
Note to ACs: I usually delete AC replies without reading them. If you want to talk to me, log in.