(definition)
Definition: A Turing machine with an extra oracle tape and three extra states q?, qy, qn. When the machine enters q?, control goes to state qy if the oracle tape content is in the oracle set; otherwise control goes to state qn.
See also alternating Turing machine, nondeterministic Turing machine, probabilistic Turing machine, universal Turing machine.
Note: From Algorithms and Theory of Computation Handbook, pages 24-19 and 28-25, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:06:05 2004.
HTML page formatted Wed Oct 26 09:47:54 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "oracle Turing machine", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/oracleTur.html
