The Wolfram 2,3 Turing Machine

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.

THINGS TO TRY

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • 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 »

Files require Wolfram CDF Player or Mathematica.