1. Adventures in Computation: A PhD student at Carnegie Mellon focuses on theoretical computation.
  2. Algorithmic Game-Theory/Economics: Noam Nisan is a CS Professor at the Hebrew University of Jerusalem and a Research Scientist in Google, Tel-Aviv.
  3. Andy’s Math/CS page: Sporadic notes on mathematical and non-mathematical topics, from a student of computational complexity.
  4. bit-player: This blogger is no amateur, as he’s the senior writer for American Scientist, and writes that magazine’s Computing Science column. This blog focuses on computing and mathematics.
  5. Combinatorics and more: Gil Kalai, mathematician, works mainly on geometric combinatorics and the study of convex polytopes and related objects and on the analysis of Boolean functions and related matters.
  6. Computational Complexity: Enjoy the topic, brought to you by Lance Fortnow and Bill Gasarch and linked to Scientific American.
  7. Computational Information Geometry Wonderland: Thoughts and “serenpidity” on computational theory, geometry and any possible juxtaposition.
  8. Cryptosophy: This blog is offered by a theoretical computer scientist, a cryptographer who focuses on cryptography.
  9. dense outliers: Theoretical computer science from Down Under, rendered by Taso Viglas and Joachim Gudmundsson.
  10. Gödel’s Lost Letter and P=NP: This is a blog on P=NP and other theoretical questions within computer theory penned by Dick Lipton, Georgia Tech’s Frederick G. Storey Chair in Computing.
  11. Gowers’s Weblog: Gowers is a member of the Department of Pure Mathematics and Mathematical Statistics at Cambridge University and also a fellow of Trinity College.
  12. in theory: Home of LaTeX2WP, a program that converts a LaTeX file into something that is ready to be cut and pasted into WordPress.
  13. Inherent Uncertainty: This blog focuses on computer learning and game playing, prediction and decision-making.
  14. Paul Goldberg: This CS professor at the University of Liverpool writes about theoretical computer science, economics, and academic life in general.
  15. Shtetl-Optimized: Scott Aaronson’s stance is that quantum computers are not known to be able to solve NP-complete problems in polynomial time (see last category).
  16. The Geomblog: This blog is filled with “ruminations on computational geometry, algorithms, theoretical computer science and life.”
  17. The Leisure of the Theory Class: This blog is devoted to speculation and ruminations on all aspects of economic and game theory.
  18. the polylogblog: Andrew McGregor is an assistant professor in the computer science department at the University of Massachusetts and a member of the theory group.
  19. Theorem of the Day: Robin Whitty started Theorem of the Day in 2005, aiming for 366 theorems.
  20. What’s New: Professor Tao provides updates on his research, discussion of open problems and other maths-related topics.