2 citations · 2 across the 4 of their papers we have counts for
7 papers
Collision-resistant hash-shuffles on the reals
George Barmpalias, Xiaoyan Zhang
Oneway real functions are effective maps on positive-measure sets of reals that preserve randomness and have no effective probabilistic inversions. We construct a oneway real funct…
Aspects of Muchnik's paradox in restricted betting
George Barmpalias, Lu Liu
Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other…
Granularity of wagers in games and the possibility of savings
George Barmpalias, Nan Fang
In a casino where arbitrarily small bets are admissible, any betting strategy M can be modified into a savings strategy that, not only is successful on each casino sequence where M…
Monotonous betting strategies in warped casinos
George Barmpalias, Nan Fang, Andrew Lewis-Pye
Suppose that the outcomes of a roulette table are not entirely random, in the sense that there exists a successful betting strategy. Is there a successful `separable' strategy, in…
The idemetric property: when most distances are (almost) the same
George Barmpalias, Neng Huang, Andrew Lewis-Pye +4
We introduce the \emph{idemetric} property, which formalises the idea that most nodes in a graph have similar distances between them, and which turns out to be quite standard among…
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…