Independence, Relative Randomness, and PA Degrees
Adam R. Day, Jan Reimann

TL;DR
This paper explores the properties of pairs of reals that are mutually random with respect to non-computable measures, extending van Lambalgen's theorem, and investigates the independence spectrum of r.e. sets, with implications for PA degrees.
Contribution
It generalizes van Lambalgen's theorem to non-computable measures and characterizes the independence spectrum of r.e. sets, linking to PA degrees.
Findings
Generalized van Lambalgen's theorem for non-computable measures
No Δ^0_2 set in the independence spectrum of r.e. sets
If A is r.e. and P is PA degree with P not Turing above A, then A⊕P computes 0'
Abstract
We study pairs of reals that are mutually Martin-L\"{o}f random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen's Theorem holds for non-computable probability measures, too. We study, for a given real , the \emph{independence spectrum} of , the set of all so that there exists a probability measure so that and is -random. We prove that if is r.e., then no set is in the independence spectrum of . We obtain applications of this fact to PA degrees. In particular, we show that if is r.e.\ and is of PA degree so that , then .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
