This pretty nerdy, but it is the tech forum so I thought I'd give it a shot.
There's a proof that claim to have solved the P vs. NP problem, claiming that P != NP.
Here's a brief summary of the paper:
http://rjlipton.wordpress.com/2010/0...t-equal-to-np/
For those not familiar, this is pretty well the holy grail of theoretical computer science and a verified proof has Millenium Prize of $1M attached to it. This paper has not been peer-reviewed yet, but its generating a lot of buzz on the 'net.
If you need a refresher/explanation on the P vs. NP problem, wikipedia has a good page on it:
http://en.wikipedia.org/wiki/P_versus_NP_problem
Needless to say, if this paper is true, it has huge implications for computer science algorithms.
The paper, in its entirety (100 pages), can be found here:
http://www.scribd.com/doc/35539144/pnp12pt