Aside from the proof itself, 'exciting' would be P=NP rather than P!=NP. ________________________________ Ian Thomas Victoria Park, Western Australia
-----Original Message----- From: [email protected] [mailto:[email protected]] On Behalf Of silky Sent: Wednesday, 11 August 2010 3:38 PM To: ozDotNet Subject: Re: maybe the greatest day in computer science, proof that p != np? On Mon, Aug 9, 2010 at 7:50 PM, silky <[email protected]> wrote: > http://rjlipton.wordpress.com/2010/08/08/a-proof-that-p-is-not-equal-to-np/ > http://scottaaronson.com/blog/?p=456 > > very exciting, eagerly awaiting results ... Just incase anyone is interested and *not* following the discussion, it's not looking good: - http://rjlipton.wordpress.com/2010/08/10/update-on-deolalikars-proof-that-p% E2%89%A0np/ - http://rjlipton.wordpress.com/2010/08/09/issues-in-the-proof-that-p%e2%89%a0 np/ But it's still pretty exciting. Unless something spectacular happens I won't post about it here again; I leave it to relevant individuals to follow if they are so inclined. -- silky http://dnoondt.wordpress.com/ "Every morning when I wake up, I experience an exquisite joy - the joy of being this signature."
