2,2 Turing Machines

Requires a Wolfram Notebook System

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

Explore the behavior of the simplest nontrivial class of Turing machines—the 4096 possible machines with 2 states and 2 colors.

Contributed by: Stephen Wolfram (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