ConceptTheory & Algos
Space complexity of a Turing machine
The space complexity of a decider TM is a function mapping to the maximum number of distinct tape cells accessed by on any input of length on its work tapes.
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
3The lectures that define it or assume it, and the concepts next to it.