Martin-Löf defined infinite random sequences over a finite alphabet via randomness tests which describe sets having measure zero in a constructive sense. In this paper this concept is generalized to separable topological spaces with a measure. We show several general results, like the existence of a universal randomness test under weak conditions, and a randomness preservation result for functions between randomness spaces. Applying these ideas to the real numbers yields a direct definition of random real numbers which is shown to be equivalent to the usual one via the representation of real numbers to some base. Furthermore, we show that every nonconstant computable analytic function preserves randomness. As a second example, by considering the power set of the natural numbers with its natural topology as a randomness space, we introduce a new notion of a random set of numbers. We characterize it in terms of random sequences. Surprisingly, it turns out that there are infinite co-r.e. random sets.
CITATION STYLE
Hertling, P., & Weihrauch, K. (1998). Randomness spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 796–807). Springer Verlag. https://doi.org/10.1007/bfb0055103
Mendeley helps you to discover research relevant for your work.