Let a language A =  {(M,w) : M is a TM and w is a string such that w is accepted by M in an even number of steps}.How can I prove that this is undecidable? I have considered trying to build the ATM proof assuming this language. Language A can cover acceptance under even steps but how would I cover acceptance under uneven steps? Language A would reject in that case. How would you go about trying to build the proof via this path?Another thing I wonder is if Rice's theorem covers this language. Would this be considered a functional property? Could I use it to prove the undecidability of this language?Thanks
How do I prove that a Turing Machine that accepts a string w in an even number of steps is not decidable?
computability;turing machines;undecidability