Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence

02/12/2011

∙

by   Marcus Hutter, et al.

∙

0

∙

share

This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and philosophy. Intuitively, randomness is a lack of order or predictability. If randomness is the opposite of determinism, then algorithmic randomness is the opposite of computability. Besides many other things, these concepts have been used to quantify Ockham's razor, solve the induction problem, and define intelligence.