Theoretical computer science
Dueling algorithms
March 18, 2011
If software companies design their algorithms with the sole intention of outperforming each other, the customer can be the loser.
3 questions: P vs. NP
August 17, 2010
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?
Explained: P vs. NP
October 29, 2009
The most notorious problem in theoretical computer science remains open, but the attempts to solve it have led to profound insights.
Subscribe
