Turing machines

Definitions, semantics and programming of Turing machines (single-tape, multi-tape and multi-stack), simulations between tape models, and universal machines with their machine codes. Results showing that a model computes exactly the recursive functions go to Equivalence of models of computation.

• Single-tape Turing machines
• Multi-tape and multi-stack machines
• Universal Turing machines

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.