Consider a three-mover Turing machine. This type of TM moves the tape head three (3) times during one transition (not just once, as in a standard TM). The tape head still reads only one tape symbol at a time. For example: RRR means move right three spaces; LLR means move left twice and then back right. Thus, there are 8 possible head movement patterns: LLL, LLR, LRL, ... RRR. However, making a single move like L or R is not one of the possibilities for a single move.


Show that a three-mover TM is equivalent to a standard TM. A formal mathematical description is not needed, but you must provide enough text/diagrams to convince me that you are correct.