research
∙
04/06/2023
Compression of enumerations and gain
We study the compressibility of enumerations, and its role in the relati...
share
research
∙
06/30/2022
Growth and irreducibility in path-incompressible trees
We study effective randomness-preserving transformations of path-incompr...
research
∙
01/14/2022
Aspects of Muchnik's paradox in restricted betting
Muchnik's paradox says that enumerable betting strategies are not always...
research
∙
10/12/2018
Granularity of wagers in games and the (im)possibility of savings
In a casino where arbitrarily small bets are admissible, any betting str...
research
∙
07/10/2018
Monotonous betting strategies in warped casinos
Suppose that the outcomes of a roulette table are not entirely random, i...
research
∙
04/30/2018
The idemetric property: when most distances are (almost) the same
We introduce the idemetric property, which formalises the idea that most...
research
∙
01/05/2018
Equivalences between learning of data and probability distributions, and their applications
Algorithmic learning theory traditionally studies the learnability of ef...
research
∙
01/05/2018
An equivalence between learning of data and probability distributions, and some applications
Algorithmic learning theory traditionally studies the learnability of ef...
research
∙
10/31/2017
Algorithmic learning of probability distributions from random data in the limit
We study the problem of identifying a probability distribution for some ...
research
∙
07/25/2017