A Turing machine that cannot move left by one symbol and instead does a RESET all the way to the beginning of the tape has a transition function like:

Show that these machines ARE NOT less powerful than ordinary Turing machines, i.e., they are still capable of recognizing the class of Turingrecognizable languages.

Please type your answer, no handwritten, make sure you know what u r posting, thank you!

6 Q x Q x Tx HR, RESET), where RESET moves the read head to the fa eft edge