Abstract
AbstractAlgorithmic randomness was originally defined for Cantor space with the fair-coin measure. Recent work has examined algorithmic randomness in new contexts, in particular closed subsets of 2ɷ ([2] and [8]). In this paper we use the probability theory of closed set-valued random variables (RACS) to extend the definition of Martin-Löf randomness to spaces of closed subsets of locally compact, Hausdorff, second countable topological spaces. This allows for the study of Martin-Löf randomness in many new spaces, but also gives a new perspective on Martin-Löf randomness for 2ɷ and on the algorithmically random closed sets of [2] and [8]. The first half of this paper is devoted to developing the machinery of Martin-Löf randomness for general spaces of closed sets. We then prove some general results and move on to show how the algorithmically random closed sets of [2] and [8] fit into this new framework.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. [19] Reimann Jan and Slaman Theodore A. , Measures and their random reals , Transactions of the American Mathematical Society, to appear.
2. Computability and Randomness
3. The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
4. The probability distribution as a computational resource for randomness testing;Kjos-Hanssen;Journal of Logic and Analysis,2010
5. Random elements in effective topological spaces with measure
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献