Completely Self-referential Optimal Reinforcement Learners
暂无分享,去创建一个
[1] K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .
[2] Manuel Blum,et al. On Effective Procedures for Speeding Up Algorithms , 1971, JACM.
[3] Leonid A. Levin,et al. Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..
[4] Andrew W. Moore,et al. Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..
[5] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.
[6] M. Fitting. First-order logic and automated theorem proving (2nd ed.) , 1996 .
[7] Ofi rNw8x'pyzm,et al. The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions , 2002 .
[8] Marcus Hutter. The Fastest and Shortest Algorithm for all Well-Defined Problems , 2002, Int. J. Found. Comput. Sci..
[9] Jürgen Schmidhuber,et al. Optimal Ordered Problem Solver , 2002, Machine Learning.
[10] Jürgen Schmidhuber,et al. Gödel Machines: Towards a Technical Justification of Consciousness , 2005, Adaptive Agents and Multi-Agent Systems.
[11] Dr. Marcus Hutter,et al. Universal artificial intelligence , 2004 .
[12] David Stuart Robertson,et al. Dynamic and Distributed Interaction Protocols , 2004, Adaptive Agents and Multi-Agent Systems.