WOLFRAM|DEMONSTRATIONS PROJECT

The Wolfram 2,3 Turing Machine

​
initial condition
background
steps per panel
show mesh
show head icons
number of panels
1
2
3
4
5
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.