Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence

MaRDI QIDQ3224087zbMATH OpenFDO

Authors Marcus Hutter

Publication date 29 March 2012

Full work available at URL https://arxiv.org/abs/1102.2468, http://ebooks.worldscinet.com/ISBN/9789814327756/9789814327756_0012.html

zbMATH Keywords

algorithmic information theoryalgorithmic randomnessMartin-Löf randomness

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) General topics in artificial intelligence (68T01)

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.

Recommendations

• scientific article; zbMATH DE number 5057386
• scientific article; zbMATH DE number 5264766
• Algorithmic Randomness
• Probabilistic Algorithmic Randomness
• scientific article; zbMATH DE number 6019532
• An introduction to (algorithmic) randomness
• Algorithmic randomness and measures of complexity
• The equivalence of definitions of algorithmic randomness
• Algorithms and Randomness

Cited in

(1)

• scientific article; zbMATH DE number 6019532 (Why is no real title available?)

This page was built for publication: Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224087)