Scott Aaronson, Assoc. Prof. of Computer Science at MIT, is both the ultimate nerd and one of the most interesting people in CS these days. In this talk at Cornell, his alma mater, he talks about computational complexity, the subject matter of CS 312, and whether quantum computing will solve some of the difficult complexity problems. The link is supposed to start at 1:20:20. If it's not exactly right, you can scroll backward or forward until you get to where he starts talking.