Open problems in universal induction \& intelligence
From MaRDI portal
Open problems in universal induction \& intelligence
Abstract: 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.
Recommendations
- Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
- Asymptotic non-learnability of universal agents with computable horizon functions
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Is There an Elegant Universal Theory of Prediction?
- Algorithmic Probability: Theory and Applications
Cites work
- scientific article; zbMATH DE number 1668154 (Why is no real title available?)
- scientific article; zbMATH DE number 1678998 (Why is no real title available?)
- scientific article; zbMATH DE number 2089364 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 4160608 (Why is no real title available?)
- scientific article; zbMATH DE number 4166891 (Why is no real title available?)
- scientific article; zbMATH DE number 4078557 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 45100 (Why is no real title available?)
- scientific article; zbMATH DE number 1315585 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 1354820 (Why is no real title available?)
- scientific article; zbMATH DE number 735230 (Why is no real title available?)
- scientific article; zbMATH DE number 1979532 (Why is no real title available?)
- scientific article; zbMATH DE number 2000828 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 1748968 (Why is no real title available?)
- scientific article; zbMATH DE number 3015360 (Why is no real title available?)
- scientific article; zbMATH DE number 1875872 (Why is no real title available?)
- scientific article; zbMATH DE number 1911266 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 2188025 (Why is no real title available?)
- scientific article; zbMATH DE number 3246773 (Why is no real title available?)
- scientific article; zbMATH DE number 3357742 (Why is no real title available?)
- scientific article; zbMATH DE number 3418637 (Why is no real title available?)
- scientific article; zbMATH DE number 4187170 (Why is no real title available?)
- scientific article; zbMATH DE number 3074489 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- 10.1162/1532443041827952
- A formal theory of inductive inference. Part II
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Algorithmic complexity bounds on future prediction errors
- Algorithmic statistics
- An Information Measure for Classification
- An introduction to Kolmogorov complexity and its applications
- An invariant form for the prior probability in estimation problems
- Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
- Asymptotically efficient adaptive allocation schemes for controlled Markov chains: finite parameter space
- Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
- Asymptotics of Discrete MDL for Online Prediction
- Beyond the Turing test
- Clustering by Compression
- Complexity-based induction systems: Comparisons and convergence theorems
- Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
- Convergence and loss bounds for bayesian sequence prediction
- Elements of Information Theory
- Fast online \(Q(\lambda)\)
- General Discounting Versus Average Reward
- Gödel's theorem and information
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Inferring decision trees using the minimum description length principle
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Introduction to Time Series and Forecasting
- Kolmogorov entropy in the context of computability theory
- Language identification in the limit
- Learning Theory
- Modeling by shortest data description
- New error bounds for Solomonoff prediction
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On generalized computable universal priors and their convergence
- On semimeasures predicting Martin-Löf random sequences
- On the Complexity of Finite Sequences
- On the Length of Programs for Computing Finite Binary Sequences
- On the existence and convergence of computable universal priors
- On the possibility of learning in reactive environments with arbitrary dependence
- On universal prediction and Bayesian confirmation
- Online planning algorithms for POMDPS
- Optimal ordered problem solver
- Pattern recognition and machine learning.
- Planning and acting in partially observable stochastic domains
- Predicting non-stationary processes
- Prediction, Learning, and Games
- Probability Theory
- Randomness conservation inequalities; information and independence in mathematical theories
- Rational Learning Leads to Nash Equilibrium
- Reinforcement learning. An introduction
- Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures
- Sequence prediction based on monotone complexity.
- Sequential predictions based on algorithmic complexity
- Subjective Bayesian analysis: principles and practice
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
- The Selection of Prior Distributions by Formal Rules
- The Uncertain Reasoner's Companion
- The definition of random sequences
- Theory and Applications of Models of Computation
- Theory and Applications of Models of Computation
- Time-Series Forecasting
- Toward a model of intelligence as an economy of agents
- Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Universal forecasting algorithms
- \({\mathcal Q}\)-learning
Cited in
(5)- Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- A philosophical treatise of universal induction
- Putnam's diagonal argument and the impossibility of a universal learning machine
- Induction and Physical Theory Formation As Well As Universal Computation by Machine Learning
This page was built for publication: Open problems in universal induction \& intelligence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662486)
