3 May 2012

New "Proof" of P=NP

Credit goes to Jeff Shallit again, for having found the most stupid "mathematical paper" of all times. It can be found here. After proving that the real numbers form a countable [sic] set, the author "establishes" the proof of a long-standing open problem.

It is a recommended read for those who suffer from insomnia and other maladies. As Shallit remarks, it is "a veritable garden of crankiness".

Oh yes, let us not forget the "proof" of Fermat's last theorem.
Posted by at
Labels:

1 comment:

  1. Unknown20 Feb 2014, 04:50:00

    "Proof" of P=NP is no longer there. Guess the "fact" that P=NP means the paper was removed in polynomial time.

    ReplyDelete

Subscribe to: Post Comments (Atom)


T H E B O T T O M L I N E

What measure theory is about

It's about counting, but when things get too large.
Put otherwise, it's about addition of positive numbers, but when these numbers are far too many.

The principle of dynamic programming

max_{x,y} [f(x) + g(x,y)] = max_x [f(x) + max_y g(x,y)]

The bottom line

Nuestras horas son minutos cuando esperamos saber y siglos cuando sabemos lo que se puede aprender.
(Our hours are minutes when we wait to learn and centuries when we know what is to be learnt.) --António Machado

 Αγεωμέτρητος μηδείς εισίτω.
(Those who do not know geometry may not enter.) --Plato

Sapere Aude! Habe Muth, dich deines eigenen Verstandes zu bedienen!
(Dare to know! Have courage to use your own reason!) --Kant