State Emphasis for 2,3 Turing Machine 596440

Turing machines are simple models of computers, invented by Alan Turing. They consist of a movable head that switches between states while reading and writing symbols (colors) on a tape.
The plot shows evolutions of the 2-state, 3-color Turing machine 596440, which is the smallest universal Turing machine.
The machine evolves on a tape with an infinite background pattern. Each row of squares gives one step in the evolution of the tape. The squares correspond to bits on the tape: blue, green, and red squares represent the digits 0, 1, and 2. The position of the head is indicated by drawing one pixel in each row darker (or lighter) if the head is in state 1 (or state 2).

Note that states and directions of the head are often given by particular orientations of a tiny shape instead of by darker and lighter colors.
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+