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

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 considerint 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 highn. We also prove that there exists A such that, for each n, the real A M is highn for some universal Turing machine M by using the extended van Lambalgen's Theorem.

• Type: Journal
• Year: 2010
• Where: NDJFL
• Authors: Kenshi Miyabe
• Keywords: Computer Networks, Extended Van Lambalgen, NDJFL 2010, Universal Turing Machine, Van Lambalgen