 Where \(q_i\) is the current state, \(S_j\) the content of the square being scanned, \(S_{i,j}\) the new content of the square; \(M_{i,j}\) specifies whether the machine is to move one square to the left, to the right or to remain at the same square, and \(q_{i,j}\) is the next state of the machine. These quintuples are also called the transition rules of a given machine. The Turing machine \(T_{\textrm{Simple}}\) which, when started from a blank tape, computes the sequence \(S_0S_1S_0S_1\ldots\) is then given by  Table 1.