Consider the language L = {: M is a TM and M visits its start state at least twice when executed on ε}. Prove L with respect to decidability, recognizability, and co-recognizability.
I think the problem is recognizable, but not co-recognizable. I am trying to reduce the problem to halting problem in order to prove this. I am not sure how to create a Turing Machine for the reduction.