I "solved" this problem before realising it wasn't a decision-problem. My best is 27 chars, can anyone beat that?

The problem is to check if there are at least 2 sets of consecutive 1s in the inputs binary expansion (or equivalently, if there is a "01" in the binary expansion)