Sign inSign in

Halting problem

The problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running or continue to run forever.
as Hal Abelson & Gerald Jay Sussman defines itMITThe wording closest to all 6 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

4

Each in their own terms, from the easiest level.

  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    • 42:12Storage Allocation and Garbage Collection
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The problem of determining, given a Turing machine and an input string, whether the Turing machine will halt when run on that input string.
    • 45:06Time Complexity and Universal Turing Machines
    • 0:56Time Hierarchy Theorem
  • Erik Demaine

    MIT · Undergraduate

    The halting problem asks whether a given computer program will ever halt or stop running.
    • 9:25Computational Complexity
  • Bruno Bauwens

    HSE University · Graduate

    The set of pairs consisting of a Turing machine encoding and an input for which the machine eventually halts.
    • 56:32HSE Kolmogorov Complexity, Lecture 1: Computability and Solomonoff Induction

Lectures that assume it

1

Connections

13

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

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