Sign inSign in

Non-deterministic algorithm

An algorithm that can make non-deterministic choices, such as branching into multiple paths using 'go-to-both' operations.
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.

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

    An algorithm that can make multiple choices at each step, effectively exploring multiple computational paths simultaneously.

Connections

6

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

Concepts4

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.