Sign inSign in

Church-Turing thesis

Any real-world algorithm can be simulated or compiled by Turing machines.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe 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

3

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    The hypothesis that the intuitive notion of an algorithm is exactly captured by the formal definition of a Turing machine.
    • 48:29TM Variants, Church-Turing Thesis
  • John Carlos Baez

    International Centre for Theoretical Physics · Research

    The claim that any function from the natural numbers to itself that you can compute by any systematic procedure whatsoever is actually computable by a Turing machine.
    • 4:54Algorithmic Thermodynamics

Lectures that assume it

1

Connections

8

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

Concepts4

Lectures4

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.