16 citations · 54 across the 28 of their papers we have counts for
1 paper · 1 filter
Laurent Bienvenu, Frank Stephan, Jason Teutsch
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale…