116
click to vote
MST
2006
15 years 2 months ago
2006
We investigate the characterizations of effective randomness in terms of Martin-L
107
Voted
CIE
2010
Springer
15 years 6 months ago
2010
Springer
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...