Implementation of Turing machines as finite automata

Logical systems are often represented using the Turing-machine concept. A design method is described whereby the normal transition tables for a Turing machine may be translated into a state table defining the control unit as a finite-state machine, and a special shift-register configuration in place of the computing tape. Design equations and circuits are given for a 4-state Turing machine embodying a 2-symbol alphabet.