20 citations · 33 across the 29 of their papers we have counts for
4 papers · 1 filter
Algorithmic learning of probability distributions from random data in the limit
George Barmpalias, Frank Stephan
We study the problem of identifying a probability distribution for some given randomly sampled data in the limit, in the context of algorithmic learning theory as proposed recently…
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…
Aspects of Chaitin's Omega
George Barmpalias
The halting probability of a Turing machine,also known as Chaitin's Omega, is an algorithmically random number with many interesting properties. Since Chaitin's seminal work, many…
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…