20 citations · 56 across the 31 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.IT2017
Compression of data streams down to their information content
George Barmpalias, Andrew Lewis-Pye
According to Kolmogorov complexity, every finite binary string is compressible to a shortest code -- its information content -- from which it is effectively recoverable. We investi…
math.LO2017
Limits of the Kucera-Gacs coding method
George Barmpalias, Andrew Lewis-Pye
Every real is computable from a Martin-Loef random real. This well known result in algorithmic randomness was proved by Kucera and Gacs. In this survey article we discuss various a…