Abstract
We introduce the concepts of complex and autocomplex sets, where a set A is complex if there is a recursive, nondecreasing and unbounded lower bound on the Kolmogorov complexity of the prefixes (of the characteristic sequence) of A, and autocomplex is defined likewise with recursive replaced by A-recursive. We observe that exactly the autocomplex sets allow to compute words of given Kolmogorov complexity and demonstrate that a set computes a diagonally nonrecursive (DNR) function if and only if the set is autocomplex. The class of sets that compute DNR functions is intensively studied in recursion theory and is known to coincide with the class of sets that compute fixed-point free functions. Consequently, the Recursion Theorem fails relative to a set if and only if the set is autocomplex, that is, we have a characterization of a fundamental concept of theoretical computer science in terms of Kolmogorov complexity. Moreover, we obtain that recursively enumerable sets are autocomplex if and only if they are complete, which yields an alternate proof of the well-known completeness criterion for recursively enumerable sets in terms of computing DNR functions.
All results on autocomplex sets mentioned in the last paragraph extend to complex sets if the oracle computations are restricted to truth-table or weak truth-table computations, for example, a set is complex if and only if it wtt-computes a DNR function. Moreover, we obtain a set that is complex but does not compute a Martin-Löf random set, which gives a partial answer to the open problem whether all sets of positive constructive Hausdorff dimension compute Martin-Löf random sets.
Furthermore, the following questions are addressed: Given n, how difficult is it to find a word of length n that (a) has at least prefix-free Kolmogorov complexity n, (b) has at least plain Kolmogorov complexity n or (c) has the maximum possible prefix-free Kolmogorov complexity among all words of length n. All these questions are investigated with respect to the oracles needed to carry out this task and it is shown that (a) is easier than (b) and (b) is easier than (c). In particular, we argue that for plain Kolmogorov complexity exactly the PA-complete sets compute incompressible words, while the class of sets that compute words of maximum complexity depends on the choice of the universal Turing machine, whereas for prefix-free Kolmogorov complexity exactly the complete sets allow to compute words of maximum complexity.
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
Marat, M.: On some generalizations of the Fixed-Point Theorem. Soviet Mathematics (Iz. VUZ), Russian 25(5), 9–16 (1981); English translation 25(5), 1–10 (1981)
Ambos-Spies, K., Kjos-Hanssen, B., Lempp, S., Slaman, T.A.: Comparing DNR and WWKL. Journal of Symbolic Logic 69, 1089–1104 (2004)
Cristian, S.: Calude. Private Communication (2005)
Kučera, A.: Measure, \({\mathrm \Pi} \sp 0\sb 1\)-classes and complete extensions of PA. In: Recursion theory week 1984. Lecture Notes in Mathematics, vol. 1141, pp. 245–259 (1985)
Beigel, R., Buhrman, H., Fejer, P., Fortnow, L., Grabowski, P., Longpré, L., Muchnik, A., Stephan, F., Torenvliet, L.: Enumerations of the Kolmogorov function. Electronic Colloquium on Computational Complexity, TR04-015 (2004)
Jockusch Jr., C.G.: Degrees of functions with no fixed points. In: Logic, methodology and philosophy of science, VIII (Moscow, 1987). Stud. Logic Found. Math, vol. 126, pp. 191–201. North-Holland, Amsterdam (1989)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and its Applications. In: Graduate texts in Computer Science, Springer, Heidelberg (1997)
Miller, J.S.: \({\mathrm \Pi} \sp 0\sb 1\) classes in Computable Analysis and Topology. PhD thesis, Cornell University (2002)
Kjos-Hanssen, B., Nies, A., Stephan, F.: Lowness for the class of Schnorr random reals. In: SIAM Journal on Computing (to appear)
Nies, A.: Private Communication (2004)
Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)
Post, E.: Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society 50, 284–316 (1944)
Reimann, J.: Computability and Fractal Dimension. Doctoral dissertation, Fakultät für Mathematik und Informatik, Universität Heidelberg, INF 288, D-69120 Heidelberg, Germany (2004)
Reimann, J.: Extracting randomness from sequences of positive dimension. Post of an open problem in the recursion theory section of the Mathematical Logic Forum (2004), at: math.berkeley.edu/Logic/problems/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kjos-Hanssen, B., Merkle, W., Stephan, F. (2006). Kolmogorov Complexity and the Recursion Theorem. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_11
Download citation
DOI: https://doi.org/10.1007/11672142_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)