Computational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarch Scientific American writes about rescuing the enormous theorem (classification of finite simple groups) before the proof vanishes. How can a proof vanish? In mathematics and theoretical computer science, we read research papers primarily to find research questions to work on, or find techn

