Editing Turing completeness (section)

==Turing oracles==
{{main article|Oracle machine}}

A computer with access to an infinite tape of data may be more powerful than a Turing machine: for instance, the tape might contain the solution to the [[halting problem]] or some other Turing-undecidable problem. Such an infinite tape of data is called a [[Turing oracle]]. Even a Turing oracle with random data is not computable ([[Almost surely|with probability 1]]), since there are only countably many computations but uncountably many oracles. So a computer with a random Turing oracle can compute things that a Turing machine cannot.