Predictions and algorithmic statistics for infinite sequences

DOI10.1007/978-3-030-79416-3_17MaRDI QIDQ2117097zbMATH OpenOpenAlexFDO

Authors Alexey Milovanov

Publication date 21 March 2022

Full work available at URL https://arxiv.org/abs/2005.03467

zbMATH Keywords

Kolmogorov complexityalgorithmic statisticsprediciton

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• A formal theory of inductive inference. Part II
• Algorithmic Learning Theory
• Algorithmic statistics
• Algorithmic statistics: forty years later
• Asymptotics of Discrete MDL for Online Prediction
• Complexity-based induction systems: Comparisons and convergence theorems
• Kolmogorov Complexity and Algorithmic Randomness
• On Martin-Löf Convergence of Solomonoff’s Mixture
• Sequential predictions based on algorithmic complexity

Cited in

(4)

• Predictions and algorithmic statistics for infinite sequence
• Series prediction based on algebraic approximants
• A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
• Prediction and MDL for infinite sequences

This page was built for publication: Predictions and algorithmic statistics for infinite sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117097)