Journal of Symbolic Logic

Randomness, relativization and Turing degrees

André Nies, Frank Stephan, and Sebastiaan A. Terwijn

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin-Löf random relative to ∅(n-1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) ≥ |x|-c. The ‘only if' direction was obtained independently by Joseph Miller. This characterization can be extended to the case of time-bounded C-complexity. Next we prove some results on lowness. Among other things, we characterize the 2-random sets as those 1-random sets that are low for Chaitin's Ω. Also, 2-random sets form minimal pairs with 2-generic sets. The r.e. low for Ω sets coincide with the r.e. K-trivial ones. Finally we show that the notions of Martin-Löf randomness, recursive randomness, and Schnorr randomness can be separated in every high degree while the same notions coincide in every non-high degree. We make some remarks about hyperimmune-free and PA-complete degrees.

Article information

Source
J. Symbolic Logic Volume 70, Issue 2 (2005), 515-535.

Dates
First available in Project Euclid: 1 July 2005

Permanent link to this document
http://projecteuclid.org/euclid.jsl/1120224726

Digital Object Identifier
doi:10.2178/jsl/1120224726

Mathematical Reviews number (MathSciNet)
MR2140044

Zentralblatt MATH identifier
02247425

Subjects
Primary: 68Q30: Algorithmic information theory (Kolmogorov complexity, etc.) [See also 03D32] 03D15: Complexity of computation (including implicit computational complexity) [See also 68Q15, 68Q17] 03D28: Other Turing degree structures 03D80: Applications of computability and recursion theory 28E15: Other connections with logic and set theory

Citation

Nies, André; Stephan, Frank; Terwijn, Sebastiaan A. Randomness, relativization and Turing degrees. Journal of Symbolic Logic 70 (2005), no. 2, 515--535. doi:10.2178/jsl/1120224726. http://projecteuclid.org/euclid.jsl/1120224726.


Export citation

References

  • Klaus Ambos-Spies and Antonín Kučera Randomness in computability theory, Computability theory: Current trends and open problems (P. Cholak et al., editors), Contemporary Mathematics, vol. 257, American Mathematical Society,2000, pp. 1--14.
  • Gregory J. Chaitin A theory of program size formally identical to information theory, Journal of the Association for Computing Machinery, vol. 22 (1975), pp. 329--340.
  • Robert P. Daley Complexity and randomness, Computational complexity (R. Rustin, editor), Algorithmics Press,1971, pp. 113--122.
  • Osvald Demuth and Antonín Kučera Remarks on 1-genericity, semigenericity and related concepts, Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), pp. 85--94.
  • Decheng Ding, Rod Downey, and Liang Yu The complexity of the random reals, to appear.
  • Rod Downey and Evan Griffiths personal communication, Wellington, March 28, 2003.
  • Rod G. Downey, Denis R. Hirschfeldt, André Nies, and Frank Stephan Trivial reals, Proceedings of the 7th and 8th Asian Logic Conferences (7th Conference: Hsi-Tou, Taiwan 6--10 June 1999, 8th Conference: Chongqing, China 29 August--2 September 2002), World Scientific,2003, pp. 103--131.
  • Haim Gaifmann and Marc Snir Probabilities over rich languages, Journal of Symbolic Logic, vol. 47 (1982), pp. 495--548.
  • Carl G. Jockusch, Jr., Manuel Lerman, Robert I. Soare, and Robert M. Solovay Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion, Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1288--1323.
  • Steven M. Kautz, Degrees of random sets, Ph.D. thesis, Cornell University, August 1991.
  • Antonín Kučera Measure, $\Pi_1^0$-classes and complete extensions of PA, Recursion theory week (H.-D. Ebbinghaus, G. H. Müller, and G. E. Sacks, editors), Lecture Notes in Mathematics, vol. 1141, Springer-Verlag,1985, pp. 245--259.
  • Antonín Kučera and Theodore A. Slaman Randomness and recursive enumerability, SIAM Journal on Computing, vol. 31 (2001), pp. 199--211.
  • Antonín Kučera and Sebastiaan A. Terwijn Lowness for the class of random sets, Journal of Symbolic Logic, vol. 64 (1999), no. 4, pp. 1396--1402.
  • Ming Li and Paul Vitányi An introduction to Kolmogorov complexity and its applications, first ed., Springer-Verlag,1993, second edition 1997.
  • Donald W. Loveland On minimal program complexity measures, Proceedings of the 1st ACM Symposium on Theory of Computing,1969, pp. 61--66.
  • Per Martin-Löf The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602--619.
  • Wolfgang Merkle and Nenad Mihailović On the construction of effective random sets, Mathematical foundations of computer science, Lecture Notes in Computer Science, vol. 2420, Springer-Verlag,2002, pp. 568--580.
  • Joseph S. Miller Every 2-random real is Kolmogorov random, Journal of Symbolic Logic, vol. 69 (2004), no. 3, pp. 907--913.
  • André Nies Lowness properties and randomness, to appear.
  • Piergiorgio G. Odifreddi Classical recursion theory, vol. 1, North-Holland,1989, vol. 2, Elsevier, 1999.
  • Claus-Peter Schnorr A unified approach to the definition of random sequences, Mathematical Systems Theory, vol. 5 (1971), pp. 246--258.
  • Dana Scott Algebras of sets binumerable in complete extensions of arithmetic, Proceedings of Symposia in Pure and Applied Mathematics, vol. 5 (1962), pp. 117--121.
  • Robert I. Soare Recursively enumerable sets and degrees, Springer-Verlag, Heidelberg,1987.
  • Robert M. Solovay Draft of a paper (or series of papers) on Chaitin's work, manuscript, IBM Thomas J. Watson Research Center, New York, May 1975.
  • Frank Stephan Martin-Löf random and PA-complete sets, Forschungsberichte Mathematische Logik 58, Universität Heidelberg,2002.
  • Sebastiaan A. Terwijn Computability and measure, Ph.D. thesis, University of Amsterdam/ILLC,1998.
  • Sebastiaan A. Terwijn and Domenico Zambella Computational randomness and lowness, Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1199--1205.
  • Michiel van Lambalgen The axiomatization of randomness, Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1143--1167.
  • Yongge Wang Randomness and complexity, Ph.D. thesis, University of Heidelberg,1996.