Monday, January 19, 2009


Computer scientists seem to be a blogging bunch, and there are several great blogs out there for complexity theory.

The granddaddy of them all is certainly Lance Fortnow's Computational Complexity Weblog. This blog was amazing for starting as early as 2002 and for posting extremely regularly. I can't recommend enough Lance's amazing output on complexity; try reading the archives here. These days the blog is cowritten by Lance and Bill Gasarch and the output has slowed -- but one a day from the archives makes for great reading.

Two other great, long-running blogs concerned mostly with complexity are those by Scott Aaronson ("Shtetl-Optimized") and Luca Trevisan ("in theory").

Of course it's hard to draw the line between "complexity theory" and "theory of computer science", so rather than try to decide if, say, James Lee's "tcs math" is "complexity" enough to be listed, I thought I'd just point you to Arvind Narayanan's comprehensive Theory of Computing Blog Aggregator.

And I would be remiss if I didn't mention what is probably the most amazing mathy blog of all, Terry Tao's extraordinarily voluminous "What's new".

Happy reading.

1 comment:

  1. 'tis the heyday of blogs; now the White House has one !


Note: Only a member of this blog may post a comment.