7 citations · 17 across the 21 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.LO2015
Uniform van Lambalgen's theorem fails for computable randomness
Bruno Bauwens
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.…
math.LO2015★ 1 cited
Van Lambalgen's theorem fails for some computable measure
Bruno Bauwens
Van Lambalgen's theorem states that a pair of bitsequences is Martin-Löf random if and only if is Martin-Löf random and is Martin-Löf random relative to . In [In…