Solomonoff induction violates Nicod's criterion

From MaRDI portal
Publication:2835642

DOI10.1007/978-3-319-24486-0_23zbMATH Open1388.68142DBLPconf/alt/LeikeH15arXiv1507.04121OpenAlexW2963361331WikidataQ58012203 ScholiaQ58012203MaRDI QIDQ2835642FDOQ2835642


Authors: Jan Leike, Marcus Hutter Edit this on Wikidata


Publication date: 30 November 2016

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

Abstract: Nicod's criterion states that observing a black raven is evidence for the hypothesis H that all ravens are black. We show that Solomonoff induction does not satisfy Nicod's criterion: there are time steps in which observing black ravens decreases the belief in H. Moreover, while observing any computable infinite string compatible with H, the belief in H decreases infinitely often when using the unnormalized Solomonoff prior, but only finitely often when using the normalized Solomonoff prior. We argue that the fault is not with Solomonoff induction; instead we should reject Nicod's criterion.


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




Recommendations




Cites Work






This page was built for publication: Solomonoff induction violates Nicod's criterion

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