Predictions and algorithmic statistics for infinite sequences

DOI10.1007/978-3-030-79416-3_17OpenAlexW3174372362MaRDI QIDQ2117097

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)

Related Items (1)

A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE

Cites Work

• Unnamed Item
• Sequential predictions based on algorithmic complexity
• Algorithmic Statistics: Forty Years Later
• Asymptotics of Discrete MDL for Online Prediction
• Complexity-based induction systems: Comparisons and convergence theorems
• Algorithmic statistics
• Kolmogorov Complexity and Algorithmic Randomness
• On Martin-Löf Convergence of Solomonoff’s Mixture
• Algorithmic Learning Theory
• A formal theory of inductive inference. Part II

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