125 citations · 284 across the 20 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
cs.CC2003
Uniform test of algorithmic randomness over a general space
Peter Gacs
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the unifo…
math.PR2003
The Clairvoyant Demon Has a Hard Task
Peter Gacs
For some m \ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the colu…