I asked to check if Turing machine that can move only right (or stay) is equal to a standard Turing machine .
I thought to copy the input to another tape, which unrestricted. but is it possible?
thank u.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I asked to check if Turing machine that can move only right (or stay) is equal to a standard Turing machine .
I thought to copy the input to another tape, which unrestricted. but is it possible?
thank u.
Consider such a TM that always terminates, has n states and tape/input alphabet of {0,1}. On an input of size m, it must halt after at most 2*m*n steps. That’s because it cannot go through the same state reading the same symbol twice without advancing; if it did, it would not halt.
This means all problems solvable by such TM are in P. On the other hand, regular TMs exists for solving problems in EXPTIME. Since P is a proper subset of EXPTIME, the two models are not equivalent.
BTW: A Turing machine usually only has one tape, so copying to a different tape is not an opion.