Strongly Connected Components Episode 37: Scott Aaronson


Samuel Hansen is joined by Scott Aaronson, Professor of Computer Science at MIT. Their covers how Nintendo can lead to a career in theoretical computer science, a clear definition of Quantum Computing and its importance, and finally why a person would wager $200,000 that a P vs. NP proof was false. Scott Aaronson also writes a very cogent and wonderful blog, is the mind behind Complexity Zoo, and has many more interesting things available on his website.

Download this Episode

[wpaudio url=”″ text=”SCC 37: Scott Aaronson” dl=”0″]

Subscribe in iTunes(and leave us a review)
Follow @acmescience on twitter too!

One comment

Leave a Reply

Your email address will not be published. Required fields are marked *