I have a quick question regarding Turing Machine: is it "legal" to make an n-state Turing machine or does n depend on the maximum size of the entry?
For example, to code a Turing machine encoding the function which given an input writes the mirror word, I would like to be able to "count" the number of characters by storing it in a state.
And so the number of states of my machine should depend on the maximum size of the word taken as input.
omegle global ometv
I don't know if it's very clear what I'm asking, but I'm new to Turing machines technology. Please giude me properly.
thanks in advance for whom reply me.
