Abstract
We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncomputable sets or complex and autocomplex sets. We review known notions and results that appear in the literature in different contexts, put them into perspective and provide simplified or at least more direct proofs. In addition, we introduce notions of traceability and complexity such as infinitely often versions of jump traceability and of complexity, and derive results about these notions that partially can be viewed as a natural completion of the previously known results. Finally, we give a result about polynomial-time bounded notions of traceability and complexity that shows that in principle the equivalences derived so far can be transferred to the time-bounded setting.
Chapter PDF
Similar content being viewed by others
References
Barmpalias, G., Downey, R., Greenberg, N.: K-trivial degrees and the jump-traceability hierarchy. Proc. Amer. Math. Soc. 137(6), 2099–2109 (2009)
Bienvenu, L., Merkle, W.: Reconciling data compression and kolmogorov complexity. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 643–654. Springer, Heidelberg (2007)
Cholak, P., Downey, R., Greenberg, N.: Strong jump-traceability I: The computably enumerable case. Advances in Mathematics 217(5), 2045–2074 (2008)
Downey, R., Hirschfeldt, D.: Algorithmic Randomness. Springer (to appear)
Franklin, J., Greenberg, N., Stephan, F., Wu, G.: Anti-complexity, lowness and highness notions, and reducibilities with tiny use (2009) (manuscript)
Franklin, J., Stephan, F.: Schnorr trivial sets and truth-table reducibility. Journal of Symbolic Logic 75, 501–521 (2010)
Jockusch Jr., C.G.: Degrees of functions with no fixed points. In: Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, Moscow, 1987. Stud. Logic Found. Math, vol. 126, pp. 191–201. North-Holland, Amsterdam (1989)
Kanovich, M.I.: On the complexity of enumeration and decision of predicates. Soviet Math. Dokl. 11, 17–20 (1970)
Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov complexity and the recursion theorem. Trans. Amer. Math. Soc. (in print)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (2008)
Stephan, F.: Private communication (April 2010)
Terwijn, S.A., Zambella, D.: Computational randomness and lowness. The Journal of Symbolic Logic 66(3), 1199–1205 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Hölzl, R., Merkle, W. (2010). Traceable Sets. In: Calude, C.S., Sassone, V. (eds) Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology, vol 323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15240-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-15240-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15239-9
Online ISBN: 978-3-642-15240-5
eBook Packages: Computer ScienceComputer Science (R0)