The complexonaut
Scott Aaronson travels the far reaches of computational complexity, shaping conventional and quantum computing.
Scott Aaronson travels the far reaches of computational complexity, shaping conventional and quantum computing.
After glancing over a 100-page proof that claimed to solve the biggest problem in computer science, Scott Aaronson bet his house that it was wrong. Why?
The most notorious problem in theoretical computer science remains open, but the attempts to solve it have led to profound insights.