Algorithmic Learning Theory
From MaRDI portal
Publication:5464497
DOI10.1007/b100989zbMath1110.68396arXivcs/0407057OpenAlexW2583189786MaRDI QIDQ5464497
Andrej A. Muchnik, Marcus Hutter
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0407057
Related Items (8)
On semimeasures predicting Martin-Löf random sequences ⋮ On universal prediction and Bayesian confirmation ⋮ On generalized computable universal priors and their convergence ⋮ Algorithmic complexity bounds on future prediction errors ⋮ Open problems in universal induction \& intelligence ⋮ On Martin-Löf Convergence of Solomonoff’s Mixture ⋮ On Martin-Löf (non-)convergence of Solomonoff's universal mixture ⋮ Predictions and algorithmic statistics for infinite sequences
This page was built for publication: Algorithmic Learning Theory
