Algorithmic statistics and prediction for polynomial time-bounded algorithms

DOI10.1007/978-3-319-94418-0_29MaRDI QIDQ1670753zbMATH OpenOpenAlexFDO

Authors Alexey Milovanov

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94418-0_29

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Inference from stochastic processes and prediction (62M20) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Algorithmic statistics, prediction and machine learning
• scientific article; zbMATH DE number 7204268
• Algorithmic statistics: forty years later

Cited in

(4)

• Algorithmic statistics, prediction and machine learning
• scientific article; zbMATH DE number 7204268 (Why is no real title available?)
• Prediction and MDL for infinite sequences
• Algorithmic complexity bounds on future prediction errors

This page was built for publication: Algorithmic statistics and prediction for polynomial time-bounded algorithms

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