Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence

zbMATH Open1243.68195arXiv1102.2468MaRDI QIDQ3224087

Marcus Hutter

Publication date: 29 March 2012

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.

Full work available at URL: https://arxiv.org/abs/1102.2468

zbMATH Keywords

algorithmic information theoryMartin-Löf randomnessalgorithmic randomness

Mathematics Subject Classification ID

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

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithmic randomness and measures of complexity 👍 👎
• Algorithms and Randomness 👍 👎
• Algorithmic Randomness 👍 👎
• The Equivalence of Definitions of Algorithmic Randomness† 👍 👎
• Probabilistic Algorithmic Randomness 👍 👎

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)