Predictions and algorithmic statistics for infinite sequences

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

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

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

Cited In (4)

• A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
• Predictions and algorithmic statistics for infinite sequence
• Series prediction based on algebraic approximants
• 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)