Turing Machine Enumeration

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

A Turing machine with possible head states and possible tape colors faces possible situations. Assuming the head can move in different locations, where is most often 2, a Turing machine can produce outputs. There are thus possible Turing machines of this sort.

[more]

This Demonstration shows the enumeration scheme used by Mathematica for describing one-dimensional Turing machines. The top portion of each of the cells in the grid shows the input state of the Turing machine while the bottom portion shows its output. The integer code of the Turing machine being displayed and its associated transition rules are also shown.

[less]

Contributed by: Seth J. Chandler (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send