Everything about Oracle machine
Abstract machine used to study decision problems
In complexity theory and computability theory, an oracle machine is an abstract machine that can query a black box called an oracle, which is able to give an answer to any instance of a certain problem in a single operation. The problem can be of any complexity class, or it can even be an undecidable problem such as the halting problem. If another problem is reducible to in polynomial time, then the oracle machine can solve in polynomial time; one can say that is in the relativized complexity class . Other relativized complexity classes such as can be defined analogously. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Oracle machineA 5-minute orientation
- Skim a recent paper: Effect of machine learning models on clinician prediction of postoperative complications: the Perioperative ORACLE randomised clinical trialInfluential work since 2022
- Pick up a classic book: Cloud Computing Using Oracle Application ExpressThe most-reprinted book on the subject
- Read the landmark paper: OMLA: An Oracle-Less Machine Learning-Based Attack on Logic LockingCited 68 times
- Go sideways: Complexity classA closely related topic
- Go sideways: ♯PA closely related topic
📖 Definitions
Noun In computability theory, a form of theoretical Turing machine, able to solve even undecidable decision problems in a single operation.
🏆 Landmark papers (most cited)
OMLA: An Oracle-Less Machine Learning-Based Attack on Logic Locking
UNSAIL : Thwarting Oracle-Less Machine Learning Attacks on Logic Locking
A dataset of oracle characters for benchmarking machine learning algorithms
Oracle properties of SCAD-penalized support vector machine
Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machine
Oracle of Our Time: Machine Learning for Predicting Cardiovascular Events
Oracle decoding as a new way to analyze phrase-based machine translation
Clinical Oracle: Machine Learning in Medicine
🆕 Influential since 2022
Effect of machine learning models on clinician prediction of postoperative complications: the Perioperative ORACLE randomised clinical trial
Oracle OIPA Cloud Migration Analysis: Machine Learning Models for Predicting Resource Utilization and Success Outcomes
Machine Learning–Driven Screening of High‐Activity Antitumor Nanozymes Using an Ensemble Enzymatic Oracle System
Automated Risk Scoring in Oracle Fusion ERP Using Machine Learning
TestLock: a testability logic locking method against machine learning-based oracle-less attacks
📚 Books worth reading
Cloud Computing Using Oracle Application ExpressRiaz Ahmed · 2016
Oracle Business Intelligence with Machine Learning: Artificial Intelligence Techniques in OBIEE for Actionable BIRosendo Abellera · 2017
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- ♯P In computational complexity theory, the complexity class #P (pronounced "sharp P" or, sometimes "number P" or "hash P") is the set of the counting problems…
- BPP (complexity) In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems solvable…
- Cook–Levin theorem In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete…
- Berman–Hartmanis conjecture Unsolved problem in computer science Is there a polynomial time isomorphism between every two NP-complete languages? More unsolved problems in computer…
- P/poly In computational complexity theory, P/poly is a complexity class that can be defined in both circuit complexity and non-uniform complexity. Since the two…
- NP (complexity) Unsolved problem in computer science 𝖯 =? 𝖭𝖯 More unsolved problems in computer science In computational complexity theory, NP (nondeterministic polynomial…
- Polynomial hierarchy In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that…