Sign inSign in

Non-deterministic Turing machine

A Turing machine that can have multiple possible next states from a given state and input symbol.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A Turing machine where each step can branch into multiple possible next configurations.

Lectures that assume it

16

The first 12 are shown.

Connections

25

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

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.