So in a book that I'm reading it says that we can convert any given Turing machine to a standard turing machine with only 6 states
furthermore we can convert any given to a turing machine with only 3 states given we have no limitation on which version of turing machine we use(multi tape, non deterministic, etc so its not a standard turing machine anymore) and obviously both the original turing machine and the converted one have the same functionality(accept the same language)
i asked this here before but no one was able to give a proof of this, and i do not understand it either
so what's this statement based on? i tried searching the web but there was literally 0 article about this.
I think this is done the same way we can reduce any PDA to a PDA with only 3 states, but i dont know the prove of that one either, i just know its true