Multi-track Turing machine

A Multitrack Turing machine is a specific type of multi-tape Turing machine.

In a standard n-tape Turing machine, n heads move independently along n tracks. In a n-track Turing machine, one head reads and writes on all tracks simultaneously. A tape position in an n-track Turing Machine contains n symbols from the tape alphabet. It is equivalent to the standard Turing machine and therefore accepts precisely the recursively enumerable languages.

Formal definition

A multitrack Turing machine with $n$-tapes can be formally defined as a 6-tuple$M=⟨Q,\mathrm{\Sigma },\mathrm{\Gamma },\delta ,q_0,F⟩$, where

• $Q$ is a finite set of states;
• $\mathrm{\Sigma }\subseteq \mathrm{\Gamma }\setminus \{b\}$ is a finite set of input symbols, that is, the set of symbols allowed to appear in the initial tape contents;
• $\mathrm{\Gamma }$ is a finite set of tape alphabet symbols;
• $q_0\in Q$ is the initial state;
• $F\subseteq Q$ is the set of final or accepting states;
• $\delta :(Q\mathrm{\setminus }F\times {\mathrm{\Gamma }}^n)\to (Q\times {\mathrm{\Gamma }}^n\times \{L,R\})$ is a partial function called the transition function.

Sometimes also denoted as $\delta (Q_i,[x_1,x_2...x_n])=(Q_j,[y_1,y_2...y_n],d)$, where $d\in \{L,R\}$.

A non-deterministic variant can be defined by replacing the transition function $\delta$ by a transition relation $\delta \subseteq (Q\mathrm{\setminus }F\times {\mathrm{\Gamma }}^n)\times (Q\times {\mathrm{\Gamma }}^n\times \{L,R\})$.

Proof of equivalency to standard Turing machine

This will prove that a two-track Turing machine is equivalent to a standard Turing machine. This can be generalized to a n-track Turing machine. Let L be a recursively enumerable language. Let $M=⟨Q,\mathrm{\Sigma },\mathrm{\Gamma },\delta ,q_0,F⟩$ be standard Turing machine that accepts L. Let Template:Mvar is a two-track Turing machine. To prove Template:Tmath it must be shown that $M\subseteq M^{\prime }$ and $M^{\prime }\subseteq M$.

• $M\subseteq M^{\prime }$

If the second track is ignored then Template:Mvar and Template:Mvar are clearly equivalent.

• $M^{\prime }\subseteq M$

The tape alphabet of a one-track Turing machine equivalent to a two-track Turing machine consists of an ordered pair. The input symbol a of a Turing machine Template:Mvar can be identified as an ordered pair Template:Tmath of Turing machine Template:Mvar. The one-track Turing machine is:

$M=⟨Q,\mathrm{\Sigma }\times B,\mathrm{\Gamma }\times \mathrm{\Gamma },{\delta }^{\prime },q_0,F⟩$ with the transition function $\delta (q_i,[x_1,x_2])={\delta }^{\prime }(q_i,[x_1,x_2])$

This machine also accepts L.

References

• Thomas A. Sudkamp (2006). Languages and Machines, Third edition. Addison-Wesley. Template:Isbn. Chapter 8.6: Multitape Machines: pp 269–271