von Neumann’s biased coin revisited

Laurent Bienvenu 1 Benoit Monin 2
1 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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 C of measures, and suppose we know C but not µ (in the above example, C would be the class of all Bernoulli measures), can perfect randomness be produced? We will look at this question from the viewpoint of constructive mathematics and in particular the theory of effective randomness.
Type de document :
Communication dans un congrès
LICS: Logic in Computer Science, Jun 2012, Dubrovnik, Croatia. 2012
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01397207
Contributeur : Benoit Monin <>
Soumis le : mardi 15 novembre 2016 - 15:38:33
Dernière modification le : jeudi 24 mai 2018 - 15:59:23
Document(s) archivé(s) le : jeudi 16 mars 2017 - 16:35:23

Fichier

paper_biased_coin.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01397207, version 1

Citation

Laurent Bienvenu, Benoit Monin. von Neumann’s biased coin revisited. LICS: Logic in Computer Science, Jun 2012, Dubrovnik, Croatia. 2012. 〈hal-01397207〉

Partager

Métriques

Consultations de la notice

158

Téléchargements de fichiers

47