Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence
Information Theory
2012-02-10 v1 Artificial Intelligence
Computational Complexity
math.IT
Abstract
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.
Cite
@article{arxiv.1102.2468,
title = {Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence},
author = {Marcus Hutter},
journal= {arXiv preprint arXiv:1102.2468},
year = {2012}
}
Comments
9 LaTeX pages