ConceptPhysics
Universal prefix-free Turing machine
A prefix-free Turing machine that can simulate any other prefix-free Turing machine with at most a constant overhead in program length.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.