Sciweavers

Share
TCS
2010
8 years 8 months ago
Comparing notions of randomness
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...
Bart Kastermans, Steffen Lempp
FUIN
2008
108views more  FUIN 2008»
8 years 10 months ago
A Simple Proof of Miller-Yu Theorem
A few years ago a nice criterion of Martin-L
Laurent Bienvenu, Wolfgang Merkle, Alexander Shen
CCA
2009
Springer
9 years 5 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
books