76 citations · 207 across the 31 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.LO2010★ 6 cited
Arithmetic complexity via effective names for random sequences
Bjørn Kjos-Hanssen, Frank Stephan, Jason R. Teutsch
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the c…
cs.GT2010★ 5 cited
How powerful are integer-valued martingales?
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…