Since my post in December, Computer Science Stack Exchange has gone through private beta and is now accessible for everybody. Head over to cs.stackexchange.com and take a look! We are waiting for your questions so do not hesitate to post anything you have always wanted to know in computer science^{1}, be it theory, applied or even practical!

We also need more expertise: out off almost 190 questions sixteen have yet to receive a good answer. among those are one about equivalence of Büchi automata and linear μ-calculus and another about efficiently learning regular languages.

You might also want to check out our hottest questions, including why Quicksort is often considered the best sorting algorithm, encryption using NP-hard problems and connections between Gödel’s incompleteness theorem and the halting problem.

I am very excited about this site. One one hand, it gives me the opportunity to share my knowledge in computer science with a wide variety of people, and I like teaching. On the other hand, I get to learn a lot. Not only do people ask about things I know next to nothing about so I can learn from the answers, but there are also original concepts. My favorite is Patrick’s proposal of heap automata; I have spent several hours contemplating his question about their power and follow-up questions.

I hope to see you on cs.SE soon!