Prediction and MDL for infinite sequences

DOI10.1007/S00224-024-10180-0MaRDI QIDQ6635690zbMATH OpenFDO

Authors Alexey Milovanov

Publication date 12 November 2024

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00224-024-10180-0

Mathematics Subject Classification ID

Foundational topics in statistics (62Axx) Theory of computing (68Qxx) Communication, information (94Axx)

Cites work

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

This page was built for publication: Prediction and MDL for infinite sequences

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