The big news today is a circulated proof that P != NP. Researchers are analyzing the proof, and so far no one has found a flaw in it.
Me: "Did you see the 88-page paper? It is so understated. It starts off so cavalier: 'The P = NP question is generally considered one of the most important questions in computer science'..." [sending along the paper]
Stuttgart: "The title of the paper should be 'OMGWTF P != NP', and then the rest of the paper should be a dry technical proof."