Sign inSign in

Oracle machine

A Turing machine equipped with an oracle tape and oracle state that can resolve queries about a language in a single step.
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.

Turing machine2Complexity classes1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 13:20Why is P vs. NP Difficult?

Lectures that assume it

3

Connections

11

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

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.