Sign inSign in

Extended church-Turing thesis

Any real-world algorithm can be simulated by a Turing machine with at most a polynomial slowdown.
as Ryan O'Donnell defines itCarnegie Mellon University
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.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 40:16Time Complexity and Universal Turing Machines

Connections

4

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

Concepts2

Lectures2

1 lecturer. 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.