Relation To Turing Machines
The Turing computable sets of natural numbers are exactly the sets at level of the arithmetical hierarchy. The recursively enumerable sets are exactly the sets at level .
No oracle machine is capable of solving its own halting problem (a variation of Turing's proof applies). The halting problem for a oracle in fact sits in .
Post's theorem establishes a close connection between the arithmetical hierarchy of sets of natural numbers and the Turing degrees. In particular, it establishes the following facts for all n ≥ 1:
- The set (the nth Turing jump of the empty set) is many-one complete in .
- The set is many-one complete in .
- The set is Turing complete in .
The polynomial hierarchy is a "feasible resource-bounded" version of the arithmetical hierarchy in which polynomial length bounds are placed on the numbers involved (or, equivalently, polynomial time bounds are placed on the Turing machines involved). It gives a finer classification of some sets of natural numbers that are at level of the arithmetical hierarchy.
Read more about this topic: Arithmetical Hierarchy
Famous quotes containing the words relation to, relation and/or machines:
“You see, I am alive, I am alive
I stand in good relation to the earth
I stand in good relation to the gods
I stand in good relation to all that is beautiful
I stand in good relation to the daughter of Tsen-tainte
You see, I am alive, I am alive”
—N. Scott Momaday (b. 1934)
“The foregoing generations beheld God and nature face to face; we, through their eyes. Why should not we also enjoy an original relation to the universe? Why should not we have a poetry and philosophy of insight and not of tradition, and a religion by revelation to us, and not the history of theirs?”
—Ralph Waldo Emerson (1803–1882)
“In Hell all the messages you ever left on answering machines will be played back to you.”
—Judy Horacek (b. 1961)