Abstract
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular properties relating to the domain of the corresponding functions are investigated like the set DEQ of all pairs of indices of functions with the same domain, the set DMIN of all minimal indices of sets and DMIN* of all indices which are minimal with respect to equality of the domain modulo finitely many differences. A partial solution to a question of Schaefer is obtained by showing that for every universal numbering with the Kolmogorov property, the set DMIN* is Turing equivalent to the double jump of the halting problem. Furthermore, it is shown that the join of DEQ and the halting problem is Turing equivalent to the jump of the halting problem and that there are numberings for which DEQ itself has 1-generic Turing degree.
This research was supported in part by NUS grant numbers R252-000-212-112 (all authors), R252-000-308-112 (S. Jain and F. Stephan) and R146-000-114-112 (F. Stephan). Missing proofs can be found in Technical Report TRA3/09 of the School of Computing at the National University of Singapore.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Case, J., Jain, S., Suraj, M.: Control Structures in Hypothesis Spaces: The Influence on Learning. Theoretical Computer Science 270, 287–308 (2002)
Fortnow, L., Gasarch, W., Jain, S., Kinber, E., Kummer, M., Kurtz, S.A., Pleszkoch, M., Slaman, T.A., Solovay, R., Stephan, F.: Extremes in the degrees of inferability. Annals of Pure and Applied Logic 66, 231–276 (1994)
Friedberg, R.: Three theorems on recursive enumeration. The Journal of Symbolic Logic 23(3), 309–316 (1958)
Harizanov, V., Kummer, M., Owings Jr., J.C.: Frequency computation and the cardinality theorem. Journal of Symbolic Logic 57, 682–687 (1992)
Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov Complexity and the Recursion Theorem. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 149–161. Springer, Heidelberg (2006)
Jockusch, C.G.: Degrees of generic sets. London Mathematical Society Lecture Notes 45, 110–139 (1981)
Kummer, M.: A proof of Beigel’s cardinality conjecture. The Journal of Symbolic Logic 57, 677–681 (1992)
Kummer, M.: A note on the complexity of inclusion. Notre Dame Journal of Formal Logic (to appear)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)
Meyer, A.R.: Program size in restricted programming languages. Information and Control 21, 382–394 (1972)
Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland, Amsterdam (1989)
Odifreddi, P.: Classical Recursion Theory II. Studies in Logic and the Foundations of Mathematics, vol. 143. Elsevier, Amsterdam (1999)
Owings Jr., J.C.: A cardinality version of Beigel’s Nonspeedup Theorem. The Journal of Symbolic Logic 54, 761–767 (1989)
Gordon Rice, H.: Classes of enumerable sets and their decision problems. Transactions of the American Mathematical Society 74, 358–366 (1953)
Schaefer, M.: A guided tour of minimal indices and shortest descriptions. Archives for Mathematical Logic 37, 521–548 (1998)
Soare, R.I.: Recursively enumerable sets and degrees. In: Perspectives in Mathematical Logic. Springer, Berlin (1987)
Teutsch, J.: Noncomputable Spectral Sets, PhD Thesis, Indiana University (2007)
Teutsch, J.: On the Turing degrees of minimal index sets. Annals of Pure and Applied Logic 148, 63–80 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Stephan, F., Teutsch, J. (2009). Index Sets and Universal Numberings. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-03073-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03072-7
Online ISBN: 978-3-642-03073-4
eBook Packages: Computer ScienceComputer Science (R0)