Abstract
A Solovay function is a computable upper bound g for prefix-free Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constant, on infinitely many places n. We obtain natural examples of Solovay functions by showing that for some constant c 0 and all computable functions t such that c 0 n ≤ t(n), the time-bounded version K t of K is a Solovay function.
By unifying results of Bienvenu and Downey and of Miller, we show that a right-computable upper bound g of K is a Solovay function if and only if Ω g is Martin-Löf random. Letting \(\mathrm{\Omega}_g=\sum 2^{-g(n)}\), we obtain as a corollary that the Martin-Löf randomness of the various variants of Chaitin’s Ω extends to the time-bounded case in so far as \(\mathrm{\Omega}_{K^t}\) is Martin-Löf random for any t as above.
As a step in the direction of a characterization of K-triviality in terms of jump-traceability, we demonstrate that a set A is K-trivial if and only if A is Og(n) − K(n)-jump traceable for all Solovay functions g, where the equivalence remains true when we restrict attention to functions g of the form K t, either for a single or all functions t as above.
Finally, we investigate the plain Kolmogorov complexity C and its time-bounded variant Ct of initial segments of computably enumerable sets. Our main theorem here is a dichotomy similar to Kummer’s gap theorem and asserts that every high c.e. Turing degree contains a c.e. set B such that for any computable function t there is a constant c t > 0 such that for all m it holds that C\(^t(B\upharpoonright m) \geq c_t \cdot m\), whereas for any nonhigh c.e. set A there is a computable time bound t and a constant c such that for infinitely many m it holds that C\(^t(A\upharpoonright m) \leq \log m + c\). By similar methods it can be shown that any high degree contains a set B such that C\(^t(B\upharpoonright m) \geq^+ m/4\). The constructed sets B have low unbounded but high time-bounded Kolmogorov complexity, and accordingly we obtain an alternative proof of the result due to Juedes, Lathrop, and Lutz [JLL] that every high degree contains a strongly deep set.
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
Barmpalias, G., Downey, R., Greenberg, N.: K-trivial degrees and the jump-traceability hierarchy. Proc. Amer. Math. Soc.; posted on January 22, 2009, PII S 0002-9939(09)09761-5 (to appear in print)
Barzdins, J.M.: Complexity of programs to determine whether natural numbers not greater than n belong to a computably enumerable set. Soviet Math. Dokl. 9, 1251–1254 (1968)
Bienvenu, L., Downey, R.: Kolmogorov Complexity and Solovay Functions. In: Symposium on Theoretical Aspects of Computer Science , STACS 2009, pp. 147–158 (2009), http://drops.dagstuhl.de/opus/volltexte/2009/1810
Downey, R., Hirschfeldt, D.: Algorithmic Randomness (manuscript, 2009)
Juedes, D., Lathrop, J., Lutz, J.: Computational depth and reducibility. Theor. Comput. Sci. 132(2), 37–70 (1994)
Kummer, M.: Kolmogorov complexity and instance complexity of recursively enumerable sets. SIAM Journal on Computing 25, 1123–1143 (1996)
Kučera, A., Slaman, T.: Randomness and recursive enumerability. SIAM Journal on Computing 31, 199–211 (2001)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Heidelberg (2008)
Miller, J.S.: The K-degrees, low for K-degrees and weakly low for K-degrees. Notre Dame Journal of Formal Logic (to appear)
Nies, A.: Computability and Randomness. Oxford University Press, Oxford (2008)
Solovay, R.: Draft of a paper (or series of papers) on Chaitin’s work. Unpublished notes, 215 pages (1975)
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
Hölzl, R., Kräling, T., Merkle, W. (2009). Time-Bounded Kolmogorov Complexity and Solovay Functions . In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-03816-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03815-0
Online ISBN: 978-3-642-03816-7
eBook Packages: Computer ScienceComputer Science (R0)