I am trying to solve a problem concerned with a certain class of Turing machines. Namely, ones that have at most $k$ states for some fixed $k$ on binary tape alphabet, and that are deciders.
Given such a bounded machine, can we determine if it is indeed a decider? I know that for e.g. machines with bound tape we can.