P=NP
Here is my proof that P=NP, or rather, that you can solve all O(2^n) time and space problems in O(n) time and space.<p>Moore's Law says that circuit density, hence memory and CPU speed, doubles roughly every 1.5 years.<p>Take a problem which takes 2^n time.  There exist three constants, A, B, and C, such that you can do the following.  First, wait for A x n years.  Second, go to Best Buy (or whatever store exists after the alien invasion of 2092) and purchase the fastest computer you can buy with B dollars.  Third, run the problem on the computer for C x n seconds.  QED.<p>When I was a PhD student at Maryland I told this proof to the esteemed Bill Gasarch, a friend of mine.  He spat out a bunch of "no, no, no, no," then paused for a second contemplatively, then more "no, no, no...".  I'm certain that during that second pause he was thinking, "can I publish this?"  I'm sure Bill will deny this.  :-)