Shift rule

A shift rule (also called a chain rule) is a finite sequence of transitions which may be repeated an arbitrary number of times to "jump" over an entire repeated block of symbols on a compressed tape.

A simple canonical example is that if we have a Turing machine with the transition $({\textrm {S}},1)\to (0,R,{\textrm {S}})$ then using directed head notation:

$${\vphantom {\int }}{\textrm {S>}}\;1^{n}\xrightarrow {n} 0^{n}\;{\textrm {S>}}$$

In other words, if the machine is in state ${\textrm {S}}$ and the head is reading the leftmost of a sequence of $n$ ones, then $n$ steps later it will have moved to the right of this entire sequence of ones, converting them all to zeros.

To give a precise definition, suppose that there are words $t$, $r$ and $r'$ in the alphabet of the Turing machine in question, and assume that for some state ${\textrm {S}}$ the machine transitions from $t\;{\textrm {S>}}\;r$ to $r't\;{\textrm {S>}}$. Then we have a right shift rule

$$\displaystyle {\vphantom {\int }}t\;{\textrm {S>}}\;r\to r'\;t\;{\textrm {S>}}.$$

Similarly, if the machine transitions from $r\;{\textrm {<S}}\;t$ to ${\textrm {<S}}\;tr'$, then we have a left shift rule

$${\vphantom {\int }}r\;{\textrm {<S}}\;t\to {\textrm {<S}}\;t\;r'.$$

General Shift Rules

Shift rules can jump over larger blocks. For example Skelet #1 (1RB1RD_1LC0RC_1RA1LD_0RE0LB_---1RC (bbch)) exhibits the following transitions:

$${\begin{array}{rcl}\displaystyle {\vphantom {\int }}011\;{\textrm {<C}}&\xrightarrow {3} &{\textrm {<C}}\;101\\{\textrm {A>}}\;110110&\xrightarrow {10} &011011\;{\textrm {A>}}\end{array}}$$

Each of these can be repeated an arbitrary number of times, producing the general shift rules:

$${\begin{array}{rcl}\displaystyle {\vphantom {\int }}011^{n}\;{\textrm {<C}}&\xrightarrow {3n} &{\textrm {<C}}\;101^{n}\\{\textrm {A>}}\;{110110}^{n}&\xrightarrow {10n} &{011011}^{n}\;{\textrm {A>}}\\\end{array}}$$

Shift rules can also depend upon additional "local context". For example, Skelet #1 also exhibits this transition:

$${\vphantom {\int }}01\;{\textrm {<C}}\;1\xrightarrow {6} {\textrm {<C}}\;1\;01$$

and since the resulting config has the same "context" (a 1 to the right of the head), this can be repeated as well to produce the shift rule:

$${\vphantom {\int }}01^{n}\;{\textrm {<C}}\;1\xrightarrow {6n} {\textrm {<C}}\;1\;01^{n}.$$

Inductive Rules

Shift rules can be seen as the simplest example of inductive rules. Specifically, they are Level 0 Inductive rules which only use the inductive hypothesis once: Tape rewrite rules that can be proven using induction, where each step in the proof is either a basic Turing machine transition or an inductive application of the rule being proven that does not use any other previously proven rules).

Simulation Acceleration

One of the main uses of shift rules is to accelerate the simulation of Turing machines. For example, consider the simple bouncer 1RB1LA_1LA1RB (bbch) using the shift rules:

$${\begin{array}{rcl}\displaystyle {\vphantom {\int }}1^{n}\;{\textrm {<A}}&\xrightarrow {n} &{\textrm {<A}}\;1^{n}\\{\textrm {B>}}\;1^{n}&\xrightarrow {n} &1^{n}\;{\textrm {B>}}\\\end{array}}$$

We can accelerate the simulation like this:

$${\begin{array}{ll}{\text{Start}}{:}&0^{\infty }\;{\textrm {<A}}\;0^{\infty }\\{\text{Step 1}}{:}&0^{\infty }\;1\;{\textrm {B>}}\;0^{\infty }\\{\text{Step 2}}{:}&0^{\infty }\;1\;{\textrm {<A}}\;1\;0^{\infty }\\{\text{Step 3}}{:}&0^{\infty }\;{\textrm {<A}}\;1^{2}\;0^{\infty }\\\qquad \qquad \qquad \vdots \\{\text{Step }}2n^{2}+n{:}&0^{\infty }\;{\textrm {<A}}\;1^{2n}\;0^{\infty }\\{\text{Step }}2n^{2}+n+1{:}&0^{\infty }\;1\;{\textrm {B>}}\;1^{2n}\;0^{\infty }\\{\text{Step }}2n^{2}+3n+1{:}&0^{\infty }\;1^{2n+1}\;{\textrm {B>}}\;0^{\infty }\\{\text{Step }}2n^{2}+3n+2{:}&0^{\infty }\;1^{2n+1}\;{\textrm {<A}}\;1\;0^{\infty }\\{\text{Step }}2n^{2}+5n+3{:}&0^{\infty }\;{\textrm {<A}}\;1^{2n+2}\;0^{\infty }\\\qquad \qquad \qquad \vdots \\\end{array}}$$

In this case, they allow one to use $n$ simulator steps to simulate $O(n^{2})$ base steps, which is the best-case speedup using only shift rules. More general inductive rules that can further accelerate a Turing machine's simulation may build on top of shift rules.

Moving across an infinite line of 0s

Any Turing machine that has at least one of the two following types of shift rules:

$$\displaystyle {\vphantom {\int }}t\;{\textrm {S>}}\;0^{n}\to r'\;t\;{\textrm {S>}}\qquad {\text{or}}\qquad \displaystyle {\vphantom {\int }}0^{n}\;{\textrm {<S}}\;t\to {\textrm {<S}}\;t\;r',$$

and which eventually reaches the configuration $t\;{\textrm {S>}}\;0^{\infty }$ (for the first rule) or $0^{\infty }\;{\textrm {<S}}\;t$ (for the second rule) is non-halting, becoming a translated cycler.