Sign inSign in

Oracle Turing machine

A Turing machine equipped with an additional oracle tape and oracle state that allows it to decide membership in a specified language in a single step.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 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.

Turing machine6Complexity class1Computability1Decidability1Languages and decision problems1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A Turing machine that has access to an oracle capable of answering queries about a specific language in a single step.
    • 20:03Why is P vs. NP Difficult?
  • Michael Sipser

    MIT · Undergraduate

    A Turing machine equipped with an oracle that provides answers to specific problems for free.

Lectures that assume it

4

Connections

16

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.