Home

Turing Machine

Introduction

Catalog of Turing machines based on "The Annotated Turing" by Charles Petzold.

A Turing machine is composed by a list of m-configurations; the configuration and the behaviour of the Turing machine is described into the Turing machine Table.

The Turing machine Table is composed of 4 columns, the first pair of columns describes the configuration of the machine and the second pair of columns describes the behaviour of the machine. The first column contains the m-configuration, the second column contains the tape square scanned symbol, the third column contains the operations and the fourth column contains the next m-configuration.

There are some assumptions:

• The symbol "none" of the Table symbol column corresponds to a tape with no symbol (blank square)
• The symbol "any" of the Table symbol column corresponds to any non-blank symbol
• The Table operations column contains zero, one or more operations
• The available operations are: R (right), L (left), P (print), E (erase)
• The erase operation is not compared to a print operation with no symbol
• An error is thrown by print operation if the head square is already filled with a symbol
• The Turing machine evolution starts with the first m-configuration listed in the Table

Turing machine initial setup:

• The initial tape is composed of 20 blank squares
• The head is located on the first square of the initial tape

Features:

• Turing machine async evolution
• The initial tape squares are editable
• The initial tape squares size can be changed