Solomonoff Induction Violates Nicod’s Criterion
From MaRDI portal
Publication:2835642
DOI10.1007/978-3-319-24486-0_23zbMath1388.68142arXiv1507.04121OpenAlexW2963361331WikidataQ58012203 ScholiaQ58012203MaRDI QIDQ2835642
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04121
confirmationequivalence conditionBayesian reasoningdisconfirmationHempel's paradoxSolomonoff normalization
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probability and inductive logic (03B48)
Cites Work
- Unnamed Item
- A philosophical treatise of universal induction
- On the relation between descriptional complexity and algorithmic probability
- On universal prediction and Bayesian confirmation
- (Non-)Equivalence of Universal Priors
- The generalized radially symmetric wave equation
- Merging of Opinions with Increasing Information
- Complexity-based induction systems: Comparisons and convergence theorems
- Probability Theory
- Hempel's Raven Paradox: A Lacuna in the Standard Bayesian Solution
- A formal theory of inductive inference. Part I
- I.—STUDIES IN THE LOGIC OF CONFIRMATION (I.)
- An introduction to Kolmogorov complexity and its applications
- New error bounds for Solomonoff prediction