A Turing machine with left reset is similar to an ordinary Turing machine, but the transition function has the form

: Q Q {R, RESET}. If (q, a) = (r, b, RESET), when the machine is in state q reading an a, it writes b at the current tape location and then the machines head jumps to the leftmost cell of the tape and it enters state r. Note that these machines do not have the usual ability to move the head only one symbol to the left. Clearly show that Turing machines with left reset recognize the class of Turing-recognizable languages (i.e. they recognize the same class of languages as regular Turing machines).