Wolfram's 2,3 Turing Machine Step-By-Step

The step-by-step operation of Wolfram's two-state, three-color universal Turing machine candidate is illustrated here. The lookup table on the right completely defines the machine's operation by providing an action for every possible configuration of its head state and the color on the tape underneath the head. The rule case used on a given step is highlighted.

(24 lines omitted)
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+