Open problems in universal induction \& intelligence
From MaRDI portal
Publication:1662486
DOI10.3390/a2030879zbMath1461.68170arXiv0907.0746OpenAlexW2132450394WikidataQ58012382 ScholiaQ58012382MaRDI QIDQ1662486
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.0746
artificial intelligenceKolmogorov complexityinformation theoryreinforcement learningrational agentssequential decision theoryuniversal Solomonoff induction
Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) General topics in artificial intelligence (68T01)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planning and acting in partially observable stochastic domains
- Optimal ordered problem solver
- On generalized computable universal priors and their convergence
- Algorithmic complexity bounds on future prediction errors
- On the possibility of learning in reactive environments with arbitrary dependence
- Inferring decision trees using the minimum description length principle
- Modeling by shortest data description
- Universal forecasting algorithms
- Fast online \(Q(\lambda)\)
- Beyond the Turing test
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Gödel's theorem and information
- \({\mathcal Q}\)-learning
- Toward a model of intelligence as an economy of agents
- On semimeasures predicting Martin-Löf random sequences
- On universal prediction and Bayesian confirmation
- Predicting non-stationary processes
- Sequential predictions based on algorithmic complexity
- THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Asymptotically efficient adaptive allocation schemes for controlled Markov chains: finite parameter space
- Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures
- Rational Learning Leads to Nash Equilibrium
- General Discounting Versus Average Reward
- Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
- Clustering by Compression
- Convergence and loss bounds for bayesian sequence prediction
- Asymptotics of Discrete MDL for Online Prediction
- Randomness conservation inequalities; information and independence in mathematical theories
- Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
- On the Complexity of Finite Sequences
- Complexity-based induction systems: Comparisons and convergence theorems
- The Uncertain Reasoner's Companion
- The Selection of Prior Distributions by Formal Rules
- Time-Series Forecasting
- Probability Theory
- Introduction to Time Series and Forecasting
- Algorithmic statistics
- Learning Theory
- Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
- Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
- 10.1162/1532443041827952
- Learning Theory and Kernel Machines
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Prediction, Learning, and Games
- Elements of Information Theory
- On the Length of Programs for Computing Finite Binary Sequences
- An Information Measure for Classification
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- Language identification in the limit
- A formal theory of inductive inference. Part II
- On Computable Numbers, with an Application to the Entscheidungsproblem
- An invariant form for the prior probability in estimation problems
- Algorithmic Learning Theory
- Theory and Applications of Models of Computation
- Theory and Applications of Models of Computation
- An introduction to Kolmogorov complexity and its applications
- New error bounds for Solomonoff prediction
- Kolmogorov entropy in the context of computability theory
- Subjective Bayesian analysis: principles and practice
