Universal knowledge-seeking agents
From MaRDI portal
Publication:391747
DOI10.1016/j.tcs.2013.09.025zbMath1358.68238OpenAlexW2179004390MaRDI QIDQ391747
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.025
Learning and adaptive systems in artificial intelligence (68T05) Agent technology and artificial intelligence (68T42)
Related Items (2)
On the computability of Solomonoff induction and AIXI ⋮ On the Computability of Solomonoff Induction and Knowledge-Seeking
Cites Work
- A Mathematical Theory of Communication
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Asymptotic non-learnability of universal agents with computable horizon functions
- Artificial general intelligence. 4th international conference, AGI 2011, Mountain View, CA, USA, August 3--6, 2011. Proceedings
- A Monte-Carlo AIXI Approximation
- Universal Knowledge-Seeking Agents
- Asymptotically Optimal Agents
- Time Consistent Discounting
- Complexity-based induction systems: Comparisons and convergence theorems
- Probability Theory
- Optimality Issues of Universal Greedy Agents with Static Priors
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Universal knowledge-seeking agents
