Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness
From MaRDI portal
Publication:5737995
DOI10.1142/9789814449274_0014zbMath1364.03062arXiv1209.5478OpenAlexW2962837756MaRDI QIDQ5737995
Publication date: 31 May 2017
Published in: Proceedings of the 12th Asian Logic Conference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5478
van Lambalgen's theoremtruth-table reducible randomnesstruth-table Schnorr randomnessuniformly relative computable randomnessuniformly relative Schnorr randomness
Related Items
Nullifying randomness and genericity using symmetric difference, Reducibilities relating to Schnorr randomness, When does randomness come from randomness?, Schnorr randomness for noncomputable measures, Uniform van Lambalgen's theorem fails for computable randomness, Unified characterizations of lowness properties via Kolmogorov complexity, Computable Measure Theory and Algorithmic Randomness, Schnorr triviality and its equivalent notions, A Church-Turing thesis for randomness?