Abstract
Schnorr famously proved that Martin-Löf-randomness of a sequence A can be characterised via the complexity of A’s initial segments. Nies, Stephan and Terwijn as well as independently Miller showed that Kolmogorov randomness coincides with Martin-Löf randomness relative to the halting problem K; that is, a set A is Martin-Löf random relative to K iff there is no function f such that for all m and all n > f(m) it holds that C(A(0)A(1)...A(n)) ≤ n − m.
In the present work it is shown that characterisations of this style can also be given for other randomness criteria like strongly random, Kurtz random relative to K, PA-incomplete Martin-Löf random and strongly Kurtz random; here one does not just quantify over all functions f but over functions f of a specific form. For example, A is Martin-Löf random and PA-incomplete iff there is no A-recursive function f such that for all m and all n > f(m) it holds that C(A(0)A(1)...A(n)) ≤ n − m. The characterisation for strong randomness relates to functions which are the concatenation of an A-recursive function executed after a K-recursive function; this solves an open problem of Nies.
In addition to this, characterisations of a similar style are also given for Demuth randomness and Schnorr randomness relative to K. Although the unrelativised versions of Kurtz randomness and Schnorr randomness do not admit such a characterisation in terms of plain Kolmogorov complexity, Bienvenu and Merkle gave one in terms of Kolmogorov complexity defined by computable machines.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
Calude, C.S.: Information and Randomness. In: An Algorithmic Perspective, 2nd edn., Springer, Heidelberg (2002)
Chaitin, G.J.: A theory of program size formally identical to information theory. Journal of the ACM 22, 329–340 (1975)
Downey, R., Nies, A., Weber, R., Yu, L.: Lowness and \(\Pi_2^0\) Nullsets. Journal of Symbolic Logic 71, 1044–1052 (2006)
Downey, R., Griffiths, E.: On Schnorr randomness. Journal of Symbolic Logic 69, 533–554 (2004)
Gács, P.: Every sequence is reducible to a random one. Information and Control 70, 186–192 (1986)
Kučera, A.: Measure, \(\Pi^0_1\)-classes and complete extensions of PA. In: PPSN 1996. LNM, vol. 1141, pp. 245–259. Springer, Heidelberg (1985)
Kurtz, S.A.: Randomness and genericity in the degrees of unsolvatibility. PhD dissertation, University of Illinois at Urbana-Champaign (1981)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Heidelberg (2008)
Martin-Löf, P.: The definition of random sequences. Information and Control 9, 602–619 (1966)
Miller, J.S.: Every 2-random real is Kolmogorov random. Journal of Symbolic Logic 69, 907–913 (2004)
Miller, J.S.: The K-degrees, low for K degrees and weakly low for K oracles. Notre Dame Journal of Formal Logic (to appear)
Nies, A.: Computability and Randomness. Oxford Science Publications (2009)
Nies, A., Stephan, F., Terwijn, S.A.: Randomness, relativization and Turing degrees. Journal of Symbolic Logic 70, 515–535 (2005)
Odifreddi, P.: Classical Recursion Theory I. North-Holland, Amsterdam (1989)
Odifreddi, P.: Classical Recursion Theory II. Elsevier, Amsterdam (1999)
Osherson, D., Weinstein, S.: Recognizing the strong random reals. The Review of Symbolic Logic 1, 56–63 (2008)
Williams, H.C. (ed.): CRYPTO 1985. LNCS, vol. 218. Springer, Heidelberg (1971)
Schnorr, C.-P.: Process complexity and effective random tests. Journal of Computer and System Sciences 7, 376–388 (1973)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Stephan, F.: Martin-Löf Random and PA-complete Sets. In: Proceedings of ASL Logic Colloquium 2002. ASL Lecture Notes in Logic, vol. 27, pp. 342–348 (2006)
Stephan, F., Wu, G.: Presentations of K-Trivial Reals and Kolmogorov Complexity. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 461–469. Springer, Heidelberg (2005)
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., Kräling, T., Stephan, F., Wu, G. (2010). Initial Segment Complexities of Randomness Notions. 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_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-15240-5_19
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)