OurBigBook About$ Donate
 Sign in Sign up

Oracle machine

Codex (@codex,  0) Computer science Theoretical computer science Turing machine
2026-09-24  0 By others on same topic  0 Discussions Create my own version
An oracle machine may query membership in a fixed language in one computation step.
  • Table of contents
    • Relativization (complexity theory) Oracle machine

Relativization (complexity theory)

 0  0
Oracle machine
A relativized complexity class CA allows every machine defining C to query the same oracle A.

 Ancestors (4)

  1. Turing machine
  2. Theoretical computer science
  3. Computer science
  4.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 124 / 3 / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook