1 citations · 1 across the 4 of their papers we have counts for
Showing 2014 · math.LOShow all
2 papers · 2 filters
math.LO2014
On Reals with -Bounded Complexity and Compressive Power
Ian Herbert
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for re…
math.LO2014
Lowness for Integer-Valued Randomness
Ian Herbert
A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no intege…