P != NP
On August 7th I received an email stating that Vinay Deolalikar from HP labs has proven that P in fact does not equal NP. What does that really mean? In layman terms it checks if a solution to a problem can be efficiently checked by a computer, then the computer can efficiently solve the problem. The problem was introduced by Steve Cook in 1971. In this email it stated: "... And Steve Cook says that it is to be taken seriously".