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.

Comments

Re:That's what's good about critical thinkers

[Anonymous Coward]

Science without morals is how we get Josef Mengele. Morals without truth (science) is how we get to burning witches

You imply that the only source of morals is religion. I vehemently dispute that. We can develop a moral code based on humanist principles from scratch, without the need to resort to sky fairies.