Emulation of Turing Machines by Tag Systems and Register Machines

In this Demonstration we show how Turing machines (TM) can be emulated by other simple systems, namely, register machines (RM) and tag systems (TS).
There are three views.
1. A compressed register machine that emulates a Turing machine, which is obvious when one looks at the Turing machine in centered format.
2. How a register machine rule can emulate a Turing machine rule with requisite detailed emulation.
3. A tag system rule that emulates a Turing machine rule and the tag system that emulated a Turing machine.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


For the details of how these emulations are conducted, see Stephen Wolfram's A New Kind of Science, pp. 670–672, Emulating Cellular Automata with Other Systems.
    • 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.