I have a Turing Machine variant called the End Jumper - the model is exactly the same as a normal Turing Machine, except that a special instruction (in addition to the L or R tape head movements) that moves the tape head, in a single transition, to the cell directly after the last non-blank cell on the tape (i.e., at the very first blank symbol after). How does this variant compare to usual Turing Machines? It is not equivalent because we can only simulate a constant number of moves right, and this can involve arbitrarily many. It is not equivalent because there are some undecidable languages (via normal TMs) that are decidable in this model. It is equivalent because we can mark the furthest right non-blank cell on the tape and maintain it through the course of computation. It is equivalent because it is equivalent we can convert it into a Turing Machine with multiple tapes, which is equivalent to the standard model as was shown in class. There are some languages that are recognized by normal TMs and not by this model, and vice versa