Just as I am reviewing Sipser, this shows up. On that note - is anyone on HN interested in creating a CS theory online study group? You see, I've had an interest in the "important, hard problems" of our field for a very long time now: both the "is P == NP ?" and "How do you make something people want?", but in this post I'd like to address the first one. I used to toy with the idea of going to grad school, becoming a hermit, and just studying complexity theory for the next 10 years, but since then I've become somewhat disenchanted with the allure of grad school. However, I still want to know what is wrong with all the purported proofs listed here:

http://www.win.tue.nl/~gwoegi/P-versus-NP.htm

What do you guys think?