Sign inSign in

Nondeterministic time

Nondeterministic time NTIME(f(n)) is the class of languages decidable by a nondeterministic Turing machine within f(n) time steps.
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.

Turing machine2Deterministic time complexity1Time complexity1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    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.
    • 10:04P and NP, SAT, Poly-Time Reducibility

Connections

5

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

Concepts3

Lectures2

2 lecturers. 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.