Algorithmic randomness on computable metric spaces and hyperspaces

Birch, Thomas

Algorithmic randomness on computable metric spaces and hyperspaces

Master Thesis

2012

Publisher

University of Cape Town

Department

Department of Mathematics and Applied Mathematics

Faculty

Faculty of Science

Abstract

In this text we shall be focusing on generalizing Martin-Löf randomness to computable metric spaces with arbitrary measure (for examples of this type of generalization see Gács [14], Rojas and Hoyrup [15]. The aim of this generalization is to define algorithmic randomness on the hyperspace of non-empty compact subsets of a computable metric space, the study of which was first proposed by Barmpalias et al. [16] at the University of Florida in their work on the random closed subsets of the Cantor space. Much work has been done in the study of random sets with authors such as Diamondstone and Kjos-Hanssen [17] continuing the Florida approach, whilst others such as Axon [18] and Cenzer and Broadhead [19] have been studying the use of capacities to define hyperspace measures for use in randomness tests. Lastly in section 6.4 we shall be looking at the work done by Hertling and Weihrauch [13] on universal randomness tests in effective topological measure spaces and relate their results to randomness on computable metric measure spaces and in particular to the randomness of compact sets in the hyperspace of non-empty compact subsets of computable metric spaces.

Keywords

Mathematics

Reference:

Collections

Masters

Full item page