A philosophical treatise of universal induction

DOI10.3390/E13061076zbMath1296.03007arXiv1105.5721OpenAlexW2165552039WikidataQ55951231 ScholiaQ55951231MaRDI QIDQ400871

Samuel Rathmanner, Marcus Hutter

Publication date: 26 August 2014

Published in: Entropy (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic information theoryKolmogorov complexityinductive inferenceconfirmation theoryOccam's razorBayes rulesequence predictionSolomonoff inductionblack raven paradoxphilosophical issuesSolomonoff prior

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probability and inductive logic (03B48) Logic in the philosophy of science (03A10)

Related Items (10)

A circuit complexity formulation of algorithmic information theory ⋮ A generalized characterization of algorithmic probability ⋮ On the computability of Solomonoff induction and AIXI ⋮ Probabilities on sentences in an expressive logic ⋮ On Martin-Löf Convergence of Solomonoff’s Mixture ⋮ Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data ⋮ Putnam's diagonal argument and the impossibility of a universal learning machine ⋮ Solomonoff Induction Violates Nicod’s Criterion ⋮ On the Computability of Solomonoff Induction and Knowledge-Seeking ⋮ On Martin-Löf (non-)convergence of Solomonoff's universal mixture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic complexity bounds on future prediction errors
• R. A. Fisher on the history of inverse probability. With comments by Robin L. Plackett and G. A. Barnard and a rejoinder by the author
• Open problems in universal induction \& intelligence
• A complete theory of everything (will be subjective)
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• On universal prediction and Bayesian confirmation
• Information-theoretic asymptotics of Bayes methods
• Clustering by Compression
• Convergence and loss bounds for bayesian sequence prediction
• The Similarity Metric
• Merging of Opinions with Increasing Information
• On the Complexity of Finite Sequences
• Complexity-based induction systems: Comparisons and convergence theorems
• LII. An essay towards solving a problem in the doctrine of chances. By the late Rev. Mr. Bayes, F. R. S. communicated by Mr. Price, in a letter to John Canton, A. M. F. R. S
• 10.1162/1532443041827952
• The context-tree weighting method: basic properties
• A formal theory of inductive inference. Part I
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: A philosophical treatise of universal induction