Back to directory
Scott Aaronson's Shtetl-Optimized
Quantum computing and complexity theory
About
Scott Aaronson, a theoretical computer scientist, writes about quantum computing, complexity theory and the occasional argument online. He answers comments at length, which is half the appeal.
Similar to Scott Aaronson's Shtetl-Optimized
See all alternatives →Log in to save
Create a free account or log in to save this for later and find it anytime on your Saved page.
Log in or sign up