ConceptTheory & Algos
Time complexity of Turing machine simulation
Simulating an -tape Turing machine running in time on a 1-tape Turing machine takes quadratic time 𝒪(T(n)²) + 𝒪(n).
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.