Uniform test of algorithmic randomness over a general space
Theoretical Computer Science
On-Line Probability, Complexity and Randomness
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
This paper studies Dawid's prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincide. One notion is the prequential version of the measure-theoretic definition due to Martin-Löf, and the other is the prequential version of the game-theoretic definition due to Schnorr and Levin. This is another manifestation of the close relation between the two main paradigms of randomness.