We study algorithmic randomness and monotone complexity on product of the set of infinite binary sequences. We explore the following problems: monotone complexity on product space, Lambalgen's theorem for correlated probability, classification of random sets by likelihood ratio tests, decomposition of complexity and independence, and Bayesian statistics for individual random sequences. Formerly Lambalgen's theorem for correlated probability is shown under a uniform computability assumption in [H. Takahashi Inform. Compt. 2008]. In this paper we show the theorem without the assumption. © 2010 Elsevier Inc. All rights reserved.
Takahashi, H. (2011). Algorithmic randomness and monotone complexity on product space. Information and Computation, 209(2), 183–197. https://doi.org/10.1016/j.ic.2010.10.003