L'informatico di Schrödinger


P!=NP? that’s the question..

Today, surfing on the net, I came across the Ari Blinder's page (on Google Site).

The page, that you can found by following this link, contains an article in which Ari Blinder - with lack of pretension, and a good dose of wit - approach the one million dollars problem's.

The conclusions obtained are well explained by the author and show that NP!=coNP and hence P!=NP.

Obviously the problem is still open and this demonstration has, at this moment, no objectively recognized value (as claimed by the author himself) but it is interesting Blinder's approach to the problem. I suggest a reading for who, like me, is interested in complexity theory.

Tagged as: Comments Off
Comments (0) Trackbacks (0)

Sorry, the comment form is closed at this time.

Trackbacks are disabled.