Universal knowledge-seeking agents
From MaRDI portal
Recommendations
Cites work
- A Mathematical Theory of Communication
- A Monte-Carlo AIXI approximation
- An introduction to Kolmogorov complexity and its applications
- Artificial general intelligence. 4th international conference, AGI 2011, Mountain View, CA, USA, August 3--6, 2011. Proceedings
- Asymptotic non-learnability of universal agents with computable horizon functions
- Asymptotically optimal agents
- Complexity-based induction systems: Comparisons and convergence theorems
- Optimality issues of universal greedy agents with static priors
- Probability Theory
- Time consistent discounting
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Universal knowledge-seeking agents
Cited in
(8)- Universal knowledge-seeking agents
- Short-circuiting the definition of mathematical knowledge for an artificial general intelligence
- Asymptotically optimal agents
- Optimality issues of universal greedy agents with static priors
- Reward is enough
- On the computability of Solomonoff induction and AIXI
- Universal knowledge-seeking agents for stochastic environments
- On the computability of Solomonoff induction and knowledge-seeking
This page was built for publication: Universal knowledge-seeking agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391747)