Sign inSign in

Computable function

A function is computable if there is a Turing machine that halts with the function's output on its tape for any given input string.
as Michael Sipser defines itMITThe wording closest to all 3 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.

  • Michael Sipser

    MIT · Undergraduate

    • 10:44Recursion Theorem and Logic
  • Bruno Bauwens

    HSE University · Graduate

    A function that has a solution in terms of a program that halts or converges to the right answer, without regard to speed.
    • 21:42HSE Kolmogorov Complexity, Lecture 1: Computability and Solomonoff Induction

Lectures that assume it

2

Connections

14

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.