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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This thesis presents a study of morphosyntactic microvariation in (long-distance) restrictive relative clauses and related… 
2013
2013
We present the Protege plug-in NoHR that allows the user to take an $\mathcal{EL}^+_\top$ ontology, add a set of non-monotonic… 
Highly Cited
2004
Highly Cited
2004
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2004. 
1998
1998
ix Acknowledgments I am very grateful to my supervisors, Remko Scha, Peter van Emde Boas and Bipin Indurkhya, for their… 
1994
1994
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
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in… 
1992
1992
The present paper claims that Korean rela tivizat ion involves syntactic Whmovement of an empty rela tive operator. This paper… 
Review
1947
Review
1947
DR. ROBERT H. PFEIFFER of Harvard has secured himself a permanent place in Old Testament scholarship by his very learned and very…