Skip to search formSkip to main contentSkip to account menu

Oracle machine

Known as: Oracle set, Oracle (computer science), Oracle tape 
In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract machineAlgorithmically random sequenceAmplitude amplificationBerman–Hartmanis conjecture

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Doubling in relative clauses : Aspects of morphosyntactic microvariation in Dutch
This thesis presents a study of morphosyntactic microvariation in (long-distance) restrictive relative clauses and related… 
2010
2010
Arguments of Nominals in Semantic Interpretation of Biomedical Text
Based on linguistic generalizations, we enhanced an existing semantic processor, SemRep, for effective interpretation of a wide… 
2009
2009
Control flow obfuscation with information flow tracking
Recent micro-architectural research has proposed various schemes to enhance processors with additional tags to track various… 
2007
2007
Proximal-ACCPM: A Versatile Oracle Based Optimisation Method
Oracle Based Optimisation (OBO) conveniently designates an approach to handle a class of convex optimisation problems in which… 
Highly Cited
2004
Highly Cited
2004
All things being unequal : locality in movement
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2004. 
2002
2002
How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
Abstract Let us recall that Raphael Robinson's Arithmetic Q is an axiom system that differs from Peano Arithmetic essentially by… 
Review
1997
Review
1997
Advanced Database Systems
Advanced Database System by Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T. Snodgrass, V.S. Subrahmanian, and Roberto… 
1994
1994
Quasilinear Time Complexity Theory
This paper furthers the study of quasi-linear time complexity initiated by Schnorr [Sch76] and Gurevich and Shelah [GS89]. We… 
Highly Cited
1993
Highly Cited
1993
The overt syntax of relativization and topicalization in Chinese
1989
1989
Decision versus search problems in super-polynomial time
The following propositions are considered: (1) E=NE (i.e. it is decidable in exponential time whether there is a solution for an… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)