ConceptTheory & Algos
Nondeterministic time
Nondeterministic time NTIME(f(n)) is the class of languages decidable by a nondeterministic Turing machine within f(n) time steps.
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
2Each in their own terms, from the easiest level.
Michael Sipser
Nondeterministic time NTIME(t(n)) is the set of languages that can be decided by a nondeterministic Turing machine running in O(t(n)) time.
Connections
5The lectures that define it or assume it, and the concepts next to it.