8773
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
2,2 Turing Machines
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
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
Turing Machines
(
NKS|Online
)
PERMANENT CITATION
"
2,2 Turing Machines
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/22TuringMachines/
Contributed by:
Stephen Wolfram
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
The Wolfram 2,3 Turing Machine
Jesse Nochella
Causal Networks for the Wolfram 2,3 Turing Machine
Stephen Wolfram and Jesse Nochella
Rule Case Transition Diagrams for the Wolfram 2,3 Turing Machine
Stephen Wolfram and Jesse Nochella
Rule Case Fractions in the Wolfram 2,3 Turing Machine
Jesse Nochella
State Sequences in the Wolfram 2,3 Turing Machine
Jesse Nochella
The Wolfram 2,3 Turing Machine Left-Compressed Evolution
Jesse Nochella
Head Motion of the Wolfram 2,3 Turing Machine
Jesse Nochella
The Function Computed by the Wolfram 2,3 Turing Machine
Jesse Nochella
Wolfram's 2,3 Turing Machine Step-By-Step
Kovas Boguta
State Emphasis for 2,3 Turing Machine 596440
Michael Schreiber
Related Topics
Computational Universe
Computer Science
Computers
NKS / Wolfram Science
NKS Book
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+