Open problems in universal induction \& intelligence (Q1662486)

From MaRDI portal
Revision as of 18:13, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Open problems in universal induction \& intelligence
scientific article

    Statements

    Open problems in universal induction \& intelligence (English)
    0 references
    0 references
    0 references
    20 August 2018
    0 references
    Summary: 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 \textit{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.
    0 references
    Kolmogorov complexity
    0 references
    information theory
    0 references
    sequential decision theory
    0 references
    reinforcement learning
    0 references
    artificial intelligence
    0 references
    universal Solomonoff induction
    0 references
    rational agents
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references