Algorithmic Learning in a Random World

DOI10.1007/978-3-031-06649-8zbMath1502.68013OpenAlexW4312294904MaRDI QIDQ5039662

Alexander Gammerman, Vladimir Vovk, Glenn R. Shafer

Publication date: 1 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06649-8

zbMATH Keywords

Kolmogorov's algorithmic notion of randomness

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (2)

Game-theoretic statistics and safe anytime-valid inference ⋮ Testing with \(\mathrm{p}^*\)-values: between p-values, mid p-values, and e-values

This page was built for publication: Algorithmic Learning in a Random World