Open Problems in Universal Induction & Intelligence

07/04/2009
by   Marcus Hutter, et al.
0

Specialized intelligent systems can be found everywhere: finger print, handwriting, speech, and face recognition, spam filtering, chess and other game programs, robots, et al. This decade the first presumably complete mathematical theory of artificial intelligence based on universal induction-prediction-decision-action has been proposed. This information-theoretic approach solidifies the foundations of inductive inference and artificial intelligence. Getting the foundations right usually marks a significant progress and maturing of a field. The theory provides a gold standard and guidance for researchers working on intelligent algorithms. The roots of universal induction have been laid exactly half-a-century ago and the roots of universal intelligence exactly one decade ago. So it is timely to take stock of what has been achieved and what remains to be done. Since there are already good recent surveys, I describe the state-of-the-art only in passing and refer the reader to the literature. This article concentrates on the open problems in universal induction and its extension to universal intelligence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2011

An Approximation of the Universal Intelligence Measure

The Universal Intelligence Measure is a recently proposed formal definit...
research
02/28/2012

One Decade of Universal Artificial Intelligence

The first decade of this century has seen the nascency of the first math...
research
09/08/2017

Ultimate Intelligence Part III: Measures of Intelligence, Perception and Intelligent Agents

We propose that operator induction serves as an adequate model of percep...
research
04/03/2000

A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Decision theory formally solves the problem of rational agents in uncert...
research
10/16/2015

Bad Universal Priors and Notions of Optimality

A big open question of algorithmic information theory is the choice of t...
research
06/01/2013

Universal Induction with Varying Sets of Combinators

Universal induction is a crucial issue in AGI. Its practical applicabili...
research
11/20/2022

Template-Based Conjecturing for Automated Induction in Isabelle/HOL

Proof by induction plays a central role in formal verification. However,...

Please sign up or login with your details

Forgot password? Click here to reset