Independence, relative randomness, and PA degrees

DOI10.1215/00294527-2377842zbMath1332.03010arXiv1207.2533OpenAlexW1991550377MaRDI QIDQ2443114

Jan Reimann, Adam R. Day

Publication date: 4 April 2014

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.2533

zbMATH Keywords

independencealgorithmic randomnesscomputably enumerable setsvan Lambalgen's theoremPA degrees

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items

Schnorr randomness for noncomputable measures ⋮ Cone avoidance and randomness preservation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Uniform test of algorithmic randomness over a general space
• Randomness for non-computable measures
• Algorithmic Randomness and Complexity
• Von Mises' definition of random sequences reconsidered
• Measures and their random reals