On Resource-Bounded Versions of the van Lambalgen Theorem

  • Diptarka Chakraborty
  • Satyadev Nandakumar
  • Himanshu Shukla
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10185)


The van Lambalgen theorem is a surprising result in algorithmic information theory concerning the symmetry of relative randomness. It establishes that for any pair of infinite sequences A and B, B is Martin-Löf random and A is Martin-Löf random relative to B if and only if the interleaved sequence \(A \uplus B\) is Martin-Löf random. This implies that A is relative random to B if and only if B is random relative to A [1, 2, 3]. This paper studies the validity of this phenomenon for different notions of time-bounded relative randomness.

We prove the classical van Lambalgen theorem using martingales and Kolmogorov compressibility. We establish the failure of relative randomness in these settings, for both time-bounded martingales and time-bounded Kolmogorov complexity. We adapt our classical proofs when applicable to the time-bounded setting, and construct counterexamples when they fail. The mode of failure of the theorem may depend on the notion of time-bounded randomness.



The authors would like to acknowledge Jack Lutz, Manjul Gupta and Michal Koucký for helpful discussions.


  1. 1.
    van Lambalgen, M.: Random Sequences. Academish Proefschri’t, Amsterdam (1987)MATHGoogle Scholar
  2. 2.
    Nies, A.: Computability and Randomness. Oxford University Press, Inc., Oxford (2009)CrossRefMATHGoogle Scholar
  3. 3.
    Downey, R., Hirschfeldt, D.: Algorithmic randomness and complexity. Book Draft (2006)Google Scholar
  4. 4.
    Yu, L.: When van Lambalgen’s theorem fails. Proc. Am. Math. Soc. 135(3), 861–864 (2007)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Goldreich, O.: The Foundations of Cryptography. Basic Techniques, vol. 1. Cambridge University Press, Cambridge (2001)CrossRefMATHGoogle Scholar
  6. 6.
    Longpré, L., Watanabe, O.: On symmetry of information and polynomial-time invertibility. Inf. Comput. 121, 14–22 (1995)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Lee, T., Romaschenko, A.: Resource-bounded symmetry of information revisited. Theor. Comput. Sci. 345, 386–405 (2005)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Berlin (2008)CrossRefMATHGoogle Scholar
  9. 9.
    Lutz, J.H.: Resource-bounded measure. In: Proceedings of the 13th IEEE Conference on Computational Complexity, pp. 236–248. IEEE Computer Society Press, New York (1998)Google Scholar
  10. 10.
    Allender, E., Buhrman, H., Koucký, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(4), 1467–1493 (2006)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Miller, J.S., Yu, L.: On initial segment complexity and degrees of randomness. Trans. Am. Math. Soc. 360(6), 3193–3210 (2008)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Diptarka Chakraborty
    • 1
  • Satyadev Nandakumar
    • 2
  • Himanshu Shukla
    • 2
  1. 1.Computer Science Institute of Charles UniversityPraha 1Czech Republic
  2. 2.Department of Computer Science and EngineeringIndian Institute of Technology KanpurKanpurIndia

Personalised recommendations