Sign inSign in

Nondeterminism

A computational model where a machine can have multiple possible next states at any given step.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
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

3

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    A computational model where the machine can make multiple choices at once, effectively exploring all paths.
    • 7:44Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA
    • 54:01Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A feature added to a model of computation where an algorithm can branch into multiple execution paths simultaneously.
  • Leslie Lamport

    Microsoft Research · Undergraduate

    A model where a current state allows multiple possible next states through multiple variable assignments.
    • 20:15Thinking Above the Code

Lectures that assume it

1

Connections

15

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

3 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.