Universal Turing machines

Codes for machines, clocked evaluators and universal machines, completeness of codes, and the cost of universal simulation. Diagonalization against time-bounded codes goes to Hierarchy theorems.

• Codes for multi-tape Turing machines
• Codes for single-tape Turing machines
• Clocked universal Turing machine

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.