All 78 episodes of Star Trek
"Computational Complexity Weblog"
is probably interesting only for computer scientists, but for me it
brings back delightful memories about teaching a course on
computational complexity and theory of computation and running a few
graduate seminars on the topic. Occasionally, the blog also contains
posts that are interesting for general readers. My favourite posts
include "Conversations with Bill", "NP-Completeness for a 9-Year Old", "Just Because I'm a Scientist Doesn't Mean I Know Anything", "Is Encryption Doomed?", "Micromorts", "Resultaphobia!", "Impagliazzo's Five Worlds", "What if P = NP?", "Asian Food for Thought?", "The Cost of Textbooks", "Blum Complexity Measures", "Changes in Introductory Theory", "Outsourcing and the Future of Computer Science", "Is it Recursive, Computable or Decidable?", "Arrr, Even Pirates Be Polynomially-Bounded", "Seven Naughty Words", "Theory and XML", "Columbus Day", "Splitting Sets" and "Open Questions from Hopcroft and Ullman".
Comments