Uniform van Lambalgen's theorem fails for computable randomness
Logic
2019-11-13 v3
Abstract
We show that there exists a bitsequence that is not computably random for which its odd bits are computably random and its even bits are computably random relative to the odd bits. This implies that the uniform variant of van Lambalgen's theorem fails for computable randomness. (The other direction of van Lambalgen's theorem is known to hold in this case, and known to fail for the non-uniform variant.)
Cite
@article{arxiv.1510.00554,
title = {Uniform van Lambalgen's theorem fails for computable randomness},
author = {Bruno Bauwens},
journal= {arXiv preprint arXiv:1510.00554},
year = {2019}
}
Comments
4 pages