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… 
Highly Cited
2004
Highly Cited
2004
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2004. 
Highly Cited
2003
Highly Cited
2003
This paper presents a method for extracting multi-word collocations (MWCs) from text corpora, which is based on the previous… 
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
Highly Cited
1993
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in… 
1989
1989
The following propositions are considered: (1) E=NE (i.e. it is decidable in exponential time whether there is a solution for an… 
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…