Here I was just mentioning open problems a few days ago, and in a little example of synchronicity there have been a couple of recent posts on other blogs describing instances of open problems.
Ken Regan, guest posting at Computational Complexity, poses a problem asking how many gates are required in a circuit which computes a [...]
One topic that comes up on a regular basis is the question of how to come up with open problems that might be suitable for tackling. Of course everyone knows about P vs. NP, and like Fermat’s Last Theorem in number theory, this problem can serve as motivation for studying the foundations of computational [...]