Sciweavers

MST
2006
92views more  MST 2006»
14 years 12 days ago
Some Results on Effective Randomness
We investigate the characterizations of effective randomness in terms of Martin-L
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Sla...
CIE
2010
Springer
14 years 4 months ago
How Powerful Are Integer-Valued Martingales?
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...
Laurent Bienvenu, Frank Stephan, Jason Teutsch