Making Solomonoff induction effective. Or: you can learn what you can bound

DOI10.1007/978-3-642-30870-3_75zbMATH Open1357.68095OpenAlexW140394049MaRDI QIDQ2904472FDOQ2904472

Authors: Jörg Zimmermann, Armin B. Cremers 

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30870-3_75

Recommendations

• On the computability of Solomonoff induction and knowledge-seeking
• Is There an Elegant Universal Theory of Prediction?
• Inductive Inference and Reverse Mathematics
• On the computability of Solomonoff induction and AIXI
• Putnam's diagonal argument and the impossibility of a universal learning machine

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (1)

• On the computability of Solomonoff induction and knowledge-seeking

This page was built for publication: Making Solomonoff induction effective. Or: you can learn what you can bound

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