Uniform test of algorithmic randomness over a general space
Theoretical Computer Science
A computable approach to measure and integration theory
Information and Computation
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Computability and Randomness
Applications of Effective Probability Theory to Martin-Löf Randomness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
| Hi-index | 0.00 |
Suppose you want to generate a random sequence of zeros and ones and all you have at your disposal is a coin which you suspect to be biased (but do not know the bias). Can "perfect" randomness be produced with this coin? The answer is positive, thanks to a little trick discovered by von Neumann. In this paper, we investigate a generalization of this question: if we have access to a source of bits produced according to some probability measure in some class of measures, and suppose we know the class but not the measure (in the above example, the class would be the class of all Bernoulli measures), can perfect randomness be produced? We will look at this question from the viewpoint of effective mathematics and in particular the theory of effective randomness.