Uniform van Lambalgen's theorem fails for computable randomness

DOI10.1016/j.ic.2019.104486zbMath1441.68110arXiv1510.00554OpenAlexW2987945584WikidataQ126784902 ScholiaQ126784902MaRDI QIDQ2304533

Bruno Bauwens

Publication date: 12 March 2020

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

martingalealgorithmic randomnesscomputable randomnessvan Lambalgen's theorem

Mathematics Subject Classification ID

Generalizations of martingales (60G48) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (3)

Schnorr randomness for noncomputable measures ⋮ Finite-state relative dimension, dimensions of AP subsequences and a finite-state van Lambalgen's theorem ⋮ A Church-Turing thesis for randomness?

Cites Work

• Unnamed Item
• Van Lambalgen's theorem and high degrees
• On Resource-Bounded Versions of the van Lambalgen Theorem
• Algorithmic Randomness and Complexity
• When van Lambalgen’s Theorem fails
• Every sequence is reducible to a random one
• A van Lambalgen theorem for Demuth randomness
• Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness

This page was built for publication: Uniform van Lambalgen's theorem fails for computable randomness