Sign inSign in

Decider

A Turing machine that halts on every input.
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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A Turing machine M is a decider if M on X halts for all X without getting into an infinite loop.
  • Michael Sipser

    MIT · Undergraduate

    A Turing machine is a decider if it halts on every input string.
    • 1:08:26CF Pumping Lemma, Turing Machines
    • 20:42Space Complexity, PSPACE, Savitch's Theorem

Lectures that assume it

4

Connections

17

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.