Sign inSign in

Space complexity of a Turing machine

The space complexity of a decider TM is a function mapping nn to the maximum number of distinct tape cells accessed by M(x)M(x) on any input xx of length nn on its work tapes.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.