Algorithmic Identification of Probabilities Is Hard

Laurent Bienvenu 1 Benoit Monin 2 Alexander Shen 1
1 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter p. By the law of large numbers, the frequency of zeros in the sequence tends to p, and thus we can get better and better approximations of p as we read the sequence. We study in this paper a similar question, but from the viewpoint of inductive inference. We suppose now that p is a computable real, and one asks for more: as we are reading more and more bits of our random sequence, we have to eventually guess the exact parameter p (in the form of its Turing code). Can one do such a thing uniformly for all sequences that are random for computable Bernoulli measures, or even for a 'large enough' fraction of them? In this paper, we give a negative answer to this question. In fact, we prove a very general negative result which extends far beyond the class of Bernoulli measures.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [5 references]  Display  Hide  Download
Contributor : Benoit Monin <>
Submitted on : Thursday, November 17, 2016 - 3:14:08 PM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Thursday, March 16, 2017 - 4:31:16 PM


Files produced by the author(s)



Laurent Bienvenu, Benoit Monin, Alexander Shen. Algorithmic Identification of Probabilities Is Hard. ALT: Algorithmic Learning Theory, Oct 2014, Bled, Slovenia. pp.85-95, ⟨10.1007/978-3-319-11662-4_7⟩. ⟨hal-01397246⟩



Record views


Files downloads