L = {w#x | w,x {0,1} and Turing Machine Mw with input x visits every non-end state at least once}I believe this problem is undecidable.My proof would consist of me reducing L to a Halting Problem; however, the structure of these proofs seem incosistent and inconclusive. I would appreciate if I could have some constructive feedback. My understanding of the proof: Create R which decides LConstruct algorithm S, which decides Atm (which we reduce to L)Contradiction because Atm is undecidableThis is the skeleton to most Turing Machine dicidibility related  proofs I have read on the internet.
Is it decidable whether a Turing Machine will visit every non-end state from input x?
computability;undecidability;semi decidability