Oracle machine
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 R {\displaystyle R} in a single operation. The problem R {\displaystyle R} can be of any complexity class, or it can even be an undecidable problem such as the halting problem.