HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Algorithmic identification of probabilities is hard

Abstract : Reading more and more bits from an infinite binary sequence that is random for a Bernoulli measure with parameter p, we can get better and better approximations of p using the strong law of large numbers. In this paper, we study a similar situation from the viewpoint of inductive inference. Assume that p is a computable real, and we have to eventually guess the program that computes p. We show that this cannot be done computably, and extend this result to more general computable distributions. We also provide a weak positive result showing that looking at a sequence X generated according to some computable probability measure, we can guess a sequence of algorithms that, starting from some point, compute a measure that makes X Martin-Löf random.
Complete list of metadata

Contributor : Alexander Shen Connect in order to contact the contributor
Submitted on : Wednesday, May 30, 2018 - 3:28:39 PM
Last modification on : Wednesday, November 3, 2021 - 7:44:59 AM

Links full text




Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen. Algorithmic identification of probabilities is hard. Journal of Computer and System Sciences, Elsevier, 2018, 95, pp.98-108. ⟨10.1016/j.jcss.2018.01.002⟩. ⟨lirmm-01803441⟩



Record views