Emulation of Turing Machines by Tag Systems and Register Machines

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

In this Demonstration we show how Turing machines (TM) can be emulated by other simple systems, namely, register machines (RM) and tag systems (TS).

[more]

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.

[less]

Contributed by: Abigail Nussey (March 2011)
Based on a program by: Todd Rowland
Open content licensed under CC BY-NC-SA


Snapshots


Details

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 (NKS|Online).



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send