News for hackers. Stuff that matters.
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by tzs on Wednesday January 19, 2011 @06:47PM (#2121822)
Failure can be interesting. Consider the attempt a few months ago by Deolalikar. The ensuing public discussion, which including many big names in complexity theory and at least one Fields medallist, was very enlightening.

This particular attempt involves someone claiming P=NP, and they have code. Even people who aren't complexity theorists can jump in on this one, by analyzing the code to verify it really is in P, and by trying to find problem instances it fails on.

Re:The polynomial algorithm for 3-SAT problem (or P=NP) by celoyd on Wednesday January 19, 2011 @07:04PM (#2121879)
at least one Fields medallist

I think both Gowers and Tao talked about it. I don’t remember in how much depth.