Next Article in Journal
Maximum Profit Configurations of Commercial Engines
Previous Article in Journal
Distances in Probability Space and the Statistical Complexity Setup
Previous Article in Special Issue
Algorithmic Relative Complexity
Article

A Philosophical Treatise of Universal Induction

Research School of Computer Science, Australian National University, Corner of North and Daley Road, Canberra ACT 0200, Australia
Entropy 2011, 13(6), 1076-1136; https://doi.org/10.3390/e13061076
Received: 20 April 2011 / Revised: 24 May 2011 / Accepted: 27 May 2011 / Published: 3 June 2011
(This article belongs to the Special Issue Kolmogorov Complexity)
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. Although it achieves excellent theoretical results and is based on solid philosophical foundations, the requisite technical knowledge necessary for understanding this framework has caused it to remain largely unknown and unappreciated in the wider scientific community. The main contribution of this article is to convey Solomonoff induction and its related concepts in a generally accessible form with the aim of bridging this current technical gap. In the process we examine the major historical contributions that have led to the formulation of Solomonoff Induction as well as criticisms of Solomonoff and induction in general. In particular we examine how Solomonoff induction addresses many issues that have plagued other inductive systems, such as the black ravens paradox and the confirmation problem, and compare this approach with other recent approaches. View Full-Text
Keywords: sequence prediction; inductive inference; Bayes rule; Solomonoff prior; Kolmogorov complexity; Occam’s razor; philosophical issues; confirmation theory; black raven paradox sequence prediction; inductive inference; Bayes rule; Solomonoff prior; Kolmogorov complexity; Occam’s razor; philosophical issues; confirmation theory; black raven paradox
Show Figures

Graphical abstract

MDPI and ACS Style

Rathmanner, S.; Hutter, M. A Philosophical Treatise of Universal Induction. Entropy 2011, 13, 1076-1136. https://doi.org/10.3390/e13061076

AMA Style

Rathmanner S, Hutter M. A Philosophical Treatise of Universal Induction. Entropy. 2011; 13(6):1076-1136. https://doi.org/10.3390/e13061076

Chicago/Turabian Style

Rathmanner, Samuel, and Marcus Hutter. 2011. "A Philosophical Treatise of Universal Induction" Entropy 13, no. 6: 1076-1136. https://doi.org/10.3390/e13061076

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop