(Non-)Equivalence of Universal Priors

DOI10.1007/978-3-642-44958-1_33zbMath1404.68053arXiv1111.3854OpenAlexW1940938820WikidataQ58012278 ScholiaQ58012278MaRDI QIDQ2868430

No author found.

Publication date: 17 December 2013

Published in: Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.3854

Mathematics Subject Classification ID

Bayesian inference (62F15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (5)

Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy ⋮ A generalized characterization of algorithmic probability ⋮ On the computability of Solomonoff induction and AIXI ⋮ Solomonoff Induction Violates Nicod’s Criterion ⋮ On the Computability of Solomonoff Induction and Knowledge-Seeking

This page was built for publication: (Non-)Equivalence of Universal Priors