Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-26T06:33:37.543Z Has data issue: false hasContentIssue false
  • English
  • Français

On the commutativity of jumps

Published online by Cambridge University Press:  12 March 2014

Timothy H. McNicholl
Timothy H. McNicholl*
Affiliation:
Department of Mathematics, University of Dallas, Irving, Texas 75062, USA, E-mail:[email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the following classes:

● Q* (r1A1…..rkAk) which is defined to be the collection of all sets that can be computed by a Turing machine that on any input makes a total of ri, queries to Ai, for all i ∈ {1..… k}.

● Q(r1A1…..rkAk) which is defined like Q* (r1A1….. rkAk) except that queries to Ai, must be made before queries to Ai+1 for all i ∈ {1….. k – 1}.

● QC(r1A1….. rkAk) which is defined like Q{r1A1….. rkAk) except that the Turing machine must halt even if given incorrect answers to some of its queries.

We show that if A1 ….. Ak are jumps that are not too close together, then all three of these classes are identical and are not changed if we permute (r1…..rkAk). This extends a result of Beigel's [1]. Since the second class is not affected by permutations, we say that these sets commute with each other. We also show that jumps that are too close together may not commute. We also characterize the commutative sequences of sets obtained by iterating the jump operation through an ordinal notation.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 65 , Issue 4 , December 2000 , pp. 1725 - 1748
Copyright
Copyright © Association for Symbolic Logic 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Beigel, R., personal communication.Google Scholar
[2]Beigel, R. and Chang, R., Commutative queries, Information and Computation, (to appear).Google Scholar
[3]Beigel, R., Gasarch, W., Kummer, M., Martin, G., McNicholl, T., and Stephan, F., On the query complexity of classes, Proceedings of the 21st International Symposium, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 1113, 1996, pp. 206–217.Google Scholar
[4]Gasarch, W. and Martin, G., Bounded queries in recursion theory, Springer Verlag, New York, 1998.Google Scholar
[5]Hemaspaandra, E., Hemaspaandra, L., and Hempel, H., Query order in the polynomial hierarchy, Proceedings of the International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 1279, Springer-Verlag, 1997, pp. 222–232.CrossRefGoogle Scholar
[6]Hemaspaandra, L., Hempel, H., and Weschung, G., Query order, SIAM Journal on Computing, (to appear).Google Scholar
[7]Sacks, G.E., Higher recursion theory, 1st ed., Springer-Verlag, Heidelberg, 1990.CrossRefGoogle Scholar
[8]Soare, R.I., Recursively enumerable sets and degrees, 1st ed., Springer-Verlag, Berlin, Heidelberg, 1987.CrossRefGoogle Scholar