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

Abstract

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 ${\mathrm{\Omega }}^{{\varphi }^{\prime }}$ is high. We extend this result to that ${\mathrm{\Omega }}^{{\varphi }^{(n)}}$ is ${\text{high}}_n$. We also prove that there exists A such that, for each n, the real ${\mathrm{\Omega }}_M^A$ is ${\text{high}}_n$ for some universal Turing machine M by using the extended van Lambalgen's Theorem.