On universal prediction and Bayesian confirmation
From MaRDI portal
Publication:2382281
DOI10.1016/j.tcs.2007.05.016zbMath1124.68048arXiv0709.1516WikidataQ58012418 ScholiaQ58012418MaRDI QIDQ2382281
Publication date: 28 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.1516
Bayes; Kolmogorov complexity; confirmation theory; Occam's razor; model classes; black raven paradox; philosophical issues; Solomonoff prior; symmetry principle; reparametrization invariance; noncomputable environments; old-evidence/updating problem; prediction bounds; Sequence prediction
68Q32: Computational learning theory
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)