On the commutativity of jumps (Q2710604)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the commutativity of jumps |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the commutativity of jumps |
scientific article |
Statements
On the commutativity of jumps (English)
0 references
24 April 2001
0 references
jump operator
0 references
oracle Turing machine
0 references
0 references
0 references
0 references
0.8339262
0 references
The class of all sets is studied that can be computed by Turing machines that on any input make a specified number of queries to a given collection of oracles. The definition of this class is modified by requiring sequential queries to the respective oracle languages, or to require an always halting property, even if the oracle queries are answered incorrectly. It is shown that if the oracle languages are jumps that are not too close together, then all 3 of these classes are identical and are not changed if the oracle languages (and respective query numbers) are permuted. This property does not hold if the jumps are, in a sense, too close together.
0 references
