I have written the configuration sequence for $4$ Turing machines. Now I want to check which of the Turing machines are equivalent and which are not.
Are two turing machines equivalent when they do the same at an entered word? For example if both reverse the a's and b's and the c's remain constant and both halt at the same place maybe at the empty space before the string or the one after that?
Or is there an other way to check the equivalence?
Best Answer
Generally, As mentioned here:
So, you have no algorithm to decide this (see here):
Anyhow, to show two TMs are equivalent, you must simulate the transition of $M_1$ with $M_2$ and vice versa.