He is a founder of the Complexity Zoo wiki, which catalogs all classes of computational complexity.[8][9] He is the author of the much-read blog "Shtetl-Optimized"[10] as well as the essay "Who Can Name The Bigger Number?".[11] The latter work, widely distributed in academic computer science, uses the concept of Busy Beaver Numbers as described by Tibor Radó to illustrate the limits of computability in a pedagogic environment. He has also taught a graduate-level survey course called Quantum Computing Since Democritus,[12] for which the notes are available online and which has been published as a book by Cambridge University Press.[13] It weaves together seemingly disparate topics into a cohesive whole, including quantum mechanics, complexity, free will, time travel, the anthropic principle and many others. Many of these interdisciplinary applications of computational complexity were later fleshed out in his article "Why Philosophers Should Care About Computational Complexity".[14] An article of Aaronson's, "The Limits of Quantum Computers", was published in Scientific American,[15] and he was a guest speaker at the 2007 Foundational Questions in Science Institute conference.[16] Aaronson is frequently cited in non-academic press, such as Science News,[17] The Age,[18] ZDNet,[19] Slashdot,[20] New Scientist,[21] The New York Times,[22] and Forbes magazine.[23]