# A Philosophical Treatise of Universal Induction

@article{Rathmanner2011APT,
title={A Philosophical Treatise of Universal Induction},
author={Samuel Rathmanner and Marcus Hutter},
journal={Entropy},
year={2011},
volume={13},
pages={1076-1136}
}
• Published 28 May 2011
• Philosophy
• Entropy
Understanding inductive reasoning is a problem that has engaged mankind for thousands of years. This problem is relevant to a wide range of fields and is integral to the philosophy of science. It has been tackled by many great minds ranging from philosophers to scientists to mathematicians, and more recently computer scientists. In this article we argue the case for Solomonoff Induction, a formal inductive framework which combines algorithmic information theory with the Bayesian framework…

## Figures and Tables from this paper

Philosophy of science and information
This essay will restrict its attention to a broad and accessible overview of the aforementioned common themes, which, given their nature, mandate an (almost exclusive) emphasis on AIT as opposed to general information theory.
Don't choose theories: Normative inductive reasoning and the status of physical theories
Evaluating theories in physics used to be easy. Our theories provided very distinct predictions. Experimental accuracy was so small that worrying about epistemological problems was not necessary.
Foundations of Induction
Solomonoff’s formal, general, complete, and essentially unique theory of universal induction and prediction, rooted in algorithmic information theory and based on the philosophical and technical ideas of Ockham, Epicurus, Bayes, Turing, and Kolmogorov, essentially constitutes a conceptual solution to the induction problem.
Natural Descriptions and Anthropic Bias: Extant Problems In Solomonoff Induction
The theory of Solomonoff induction, which combines algorithmic information theory and Bayesian inference, has been suggested as a solution to the philosophical problem of induction and an idealisation of the scientific method.
Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence
• Computer Science
Turing's Legacy
• 2014
This work describes a computational formalism centered around a probabilistic Turing machine called QUERY, which captures the operation of Probabilistic conditioning via conditional simulation and demonstrates how the QUERY abstraction can be used to cast common-sense reasoning as probabilism inference in a statistical model of observations and the uncertain structure of the world that generated that experience.
One Decade of Universal Artificial Intelligence
This article attempts to gently introduce a very theoretical, formal, and mathematical subject, and discusses philosophical and technical ingredients, traits of intelligence, some social questions, and the past and future of UAI.
An Evolutionary Argument for a Self-Explanatory, Benevolent Metaphysics
Abstract: In this paper, a metaphysics is proposed that includes everything that can be represe nted by a well -founded multiset. It is shown that this metaphysics, apart from being self
The Relativity of Induction
The core problem of generalization is explored and it is shown that long-accepted Occam's razor and parsimony principles are insufficient to ground learning, and a set of relativistic principles are derived that yield clearer insight into the nature and dynamics of learning.
Probabilities on Sentences in an Expressive Logic
• Philosophy, Computer Science
J. Appl. Log.
• 2013
Learning Agents with Evolving Hypothesis Classes
• Psychology
AGI
• 2013
A framework for learning based on implicit beliefs over all possible hypotheses and limited sets of explicit theories sampled from an implicit distribution represented only by the process by which it generates new hypotheses is introduced.

## References

SHOWING 1-10 OF 70 REFERENCES
An Introduction to Kolmogorov Complexity and Its Applications
• Computer Science
Texts and Monographs in Computer Science
• 1993
The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics.
Dutch Bookies and Money Pumps
C ONCLUSIVE arguments in philosophy are rare, so any such argument we find we prize. If it is not only conclusive but clever, all the better for it. The Dutch book arguments of the theory of
Universal Intelligence: A Definition of Machine Intelligence
• Computer Science
Minds and Machines
• 2007
A number of well known informal definitions of human intelligence are taken, and mathematically formalised to produce a general measure of intelligence for arbitrary machines that formally captures the concept of machine intelligence in the broadest reasonable sense.
Contemporary debates in philosophy of science
Notes on Contributors.Preface.Introduction: What is the Philosophy of Science?.Part I: Do Thought Experiments Transcend Empiricism?.1. Why Thought Experiments Transcend Empiricism: James Robert Brown
A Computer Scientist's View of Life, the Universe, and Everything
Basic concepts of Kolmogorov complexity theory are applied to the set of possible universes, and perceived and true randomness, life, generalization, and learning in a given universe are discussed.
The Need for Biases in Learning Generalizations
The notion of bias in generalization problems is defined, and it is shown that biases are necessary for the inductive leap.
Complexity-based induction systems: Comparisons and convergence theorems
Levin has shown that if tilde{P}'_{M}(x) is an unnormalized form of this measure, and P( x) is any computable probability measure on strings, x, then \tilde{M}'_M}\geqCP (x) where C is a constant independent of x .
Algorithmic information theory
This article is a brief guide to the field of algorithmic information theory, its underlying philosophy, the major subfields, applications, history, and a map of the field are presented.
No free lunch theorems for optimization
• Computer Science
IEEE Trans. Evol. Comput.
• 1997
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of "no free lunch" (NFL) theorems are presented which
Universal Artificial Intellegence - Sequential Decisions Based on Algorithmic Probability
• Marcus Hutter
• Education
Texts in Theoretical Computer Science. An EATCS Series
• 2005
Reading a book as this universal artificial intelligence sequential decisions based on algorithmic probability and other references can enrich your life quality.