In [[mathematics]], an [[oracle]] is a black box posited in [[logic]] which, without revealing the methods of [[proof]], can decide whether a statement is [[true]] or [[false]]. In higher [[computability]] theory, one often makes use of oracles that can solve the [[Halting problem]] to deduce the [[undecidable|undecidability]] of [[computing]] problems. | In [[mathematics]], an [[oracle]] is a black box posited in [[logic]] which, without revealing the methods of [[proof]], can decide whether a statement is [[true]] or [[false]]. In higher [[computability]] theory, one often makes use of oracles that can solve the [[Halting problem]] to deduce the [[undecidable|undecidability]] of [[computing]] problems. |