A philosophical treatise of universal induction
From MaRDI portal
Publication:400871
DOI10.3390/e13061076zbMath1296.03007arXiv1105.5721WikidataQ55951231 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
algorithmic information theory; Kolmogorov complexity; inductive inference; confirmation theory; Occam's razor; Bayes rule; sequence prediction; Solomonoff induction; black raven paradox; philosophical issues; Solomonoff prior
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03B48: Probability and inductive logic
03A10: Logic in the philosophy of science
Related Items
On Martin-Löf Convergence of Solomonoff’s Mixture, A circuit complexity formulation of algorithmic information theory, Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data, A generalized characterization of algorithmic probability, On the computability of Solomonoff induction and AIXI, Putnam's diagonal argument and the impossibility of a universal learning machine, On Martin-Löf (non-)convergence of Solomonoff's universal mixture, Probabilities on sentences in an expressive logic, Solomonoff Induction Violates Nicod’s Criterion, On the Computability of Solomonoff Induction and Knowledge-Seeking
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
