Emulation of Turing Machines by Tag Systems and Register Machines

rule

1

2

steps

45

function

TM vs. compressed RM

rule and emulation by RM

rule and emulation by TS

Turing machine in regular and centered formats

compressed emulation of a Turing machine by a register machine

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.