Input: Turing machine M

Question: Is there a state q such that for every x, M(x) doesn't visit q?

The problem is clearly in Co-RE, but can't we look at the transition rules, or at the graph of the Turing machine and decide whether there's a state that there's no path to it?

Thanks

]]>