The Wolfram 2,3 Turing Machine

Requires a Wolfram Notebook System

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

The Wolfram 2,3 Turing machine is the smallest Turing machine known to have the property of computation universality. (The universality was established by the solution of the Wolfram 2,3 Turing machine research prize in October 2007 by Alex Smith.) Explore running the machine with different initial tapes.

Contributed by: Jesse Nochella (March 2011)
Based on work by: Stephen Wolfram
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