Sign inSign in

Decision problem

Any problem with a yes or no answer.
as Colva Roney-Dougal defines itGresham CollegeThe wording closest to all 8 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.

Computability2String2Algorithm1Computation1Computers1Encodings of mathematical objects1Function1Graph1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    An algorithmic problem where the input is given and the output is a single yes-no bit.
    • 1:07:38Course Overview and Formal Definition of Computation
    • 1:27Turing Machines
    • 8:25Course Introduction and Overview
    • 20:33Quantum Query Complexity
    • 1:37Quantum Complexity
  • Erik Demaine

    MIT · Undergraduate

    Problems where the answer is a single bit, either yes or no.
    • 2:32Complexity: P, NP, NP-completeness, Reductions
    • 11:31Computational Complexity

Lectures that assume it

15

The first 12 are shown.

Connections

32

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.