Notre Dame Journal of Formal Logic

An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals

Kenshi Miyabe


Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem by considering the join of infinitely many reals which are random relative to each other. In addition, we study computability of the reals in the range of Omega operators. It is known that Ω ϕ is high. We extend this result to that Ω ϕ ( n ) is high n . We also prove that there exists A such that, for each n, the real Ω M A is high n for some universal Turing machine M by using the extended van Lambalgen's Theorem.

Article information

Notre Dame J. Formal Logic Volume 51, Number 3 (2010), 337-349.

First available in Project Euclid: 18 August 2010

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03D32: Algorithmic randomness and dimension [See also 68Q30]
Secondary: 03D25: Recursively (computably) enumerable sets and degrees

van Lambalgen's Theorem martingale high Omega operator


Miyabe, Kenshi. An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals. Notre Dame J. Formal Logic 51 (2010), no. 3, 337--349. doi:10.1215/00294527-2010-020.

Export citation


  • [1] Buhrman, H., and L. Longpré, "Compressibility and resource bounded measure", pp. 13--24 in STACS 96 (Grenoble, 1996), vol. 1046 of Lecture Notes in Computer Science, Springer, Berlin, 1996.
  • [2] Buhrman, H., D. van Melkebeek, K. W. Regan, D. Sivakumar, and M. Strauss, "A generalization of resource-bounded measure, with application to the BPP" vs. EXP problem, SIAM Journal on Computing, vol. 30 (2000), pp. 576--601.
  • [3] Downey, R., and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Springer, Berlin, 2008.
  • [4] Downey, R., D. R. Hirschfeldt, J. S. Miller, and A. Nies, "Relativizing Chaitin's halting probability", Journal of Mathematical Logic, vol. 5 (2005), pp. 167--92.
  • [5] Kučera, A., "Measure, $\Pi^0_1$"-classes and complete extensions of $\rm PA$, pp. 245--59 in Recursion Theory Week (Oberwolfach, 1984), vol. 1141 of Lecture Notes in Mathematics, Springer, Berlin, 1985.
  • [6] van Lambalgen, M., Random Sequences, Ph.D. thesis, University of Amsterdam, Amsterdam, 1987.
  • [7] Li, M., and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 3d edition, Graduate Texts in Computer Science. Springer, New York, 2008. Also second edition (1997).
  • [8] Mayordomo, E., Contributions to the Study of Resource-Bounded Measure, Ph.D. thesis, Universidad Polytécnica de Catalunya, Barcelona, 1994.
  • [9] Nies, A., Computability and Randomness, vol. 51 of Oxford Logic Guides, Oxford University Press, Oxford, 2009.
  • [10] Odifreddi, P., Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers, vol. 125 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1989.
  • [11] Odifreddi, P. G., Classical Recursion Theory. Vol. II, vol. 143 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1999.
  • [12] Schnorr, C.-P., "A unified approach to the definition of random sequences", Mathematical Systems Theory, vol. 5 (1971), pp. 246--58.
  • [13] Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.
  • [14] Ville, J., Étude Critique de la Notion du Collectif, vol. 3 of Monographies des Probabilités, Gauthier-Villars, Paris, 1939.