暂无分享,去创建一个
[1] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[2] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[3] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[4] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..
[5] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[6] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[7] Murray S. Davis,et al. That's Interesting! , 1971 .
[8] Ray J. Solomonoff,et al. Complexity-based induction systems: Comparisons and convergence theorems , 1978, IEEE Trans. Inf. Theory.
[9] Sandy Lovie. How the mind works , 1980, Nature.
[10] H. B. Barlow,et al. Finding Minimum Entropy Codes , 1989, Neural Computation.
[11] Jürgen Schmidhuber,et al. Curious model-building control systems , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.
[12] Jürgen Schmidhuber,et al. Learning to Generate Artificial Fovea Trajectories for Target Detection , 1991, Int. J. Neural Syst..
[13] Jürgen Schmidhuber,et al. Learning Complex, Extended Sequences Using the Principle of History Compression , 1992, Neural Computation.
[14] J. Urgen Schmidhuber,et al. Learning Factorial Codes by Predictability Minimization , 1992, Neural Computation.
[15] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[16] S. Hochreiter,et al. REINFORCEMENT DRIVEN INFORMATION ACQUISITION IN NONDETERMINISTIC ENVIRONMENTS , 1995 .
[17] Andrew W. Moore,et al. Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..
[18] Jürgen Schmidhuber,et al. Sequential neural text compression , 1996, IEEE Trans. Neural Networks.
[19] Jürgen Schmidhuber,et al. Low-Complexity Art , 2017 .
[20] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.
[21] J. Schmidhuber. Facial beauty and fractal geometry , 1998 .
[22] Ofi rNw8x'pyzm,et al. The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions , 2002 .
[23] Jürgen Schmidhuber,et al. Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit , 2002, Int. J. Found. Comput. Sci..
[24] Jürgen Schmidhuber,et al. Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements , 2003, ArXiv.
[25] Jürgen Schmidhuber,et al. Exploring the predictable , 2003 .
[26] M. Balter. Seeking the Key to Music , 2004, Science.
[27] Jürgen Schmidhuber,et al. Optimal Ordered Problem Solver , 2002, Machine Learning.
[28] Marcus Hutter. Simulation Algorithms for Computational Systems Biology , 2017, Texts in Theoretical Computer Science. An EATCS Series.
[29] Jürgen Schmidhuber,et al. Gödel Machines: Towards a Technical Justification of Consciousness , 2005, Adaptive Agents and Multi-Agent Systems.
[30] Jürgen Schmidhuber,et al. Completely Self-referential Optimal Reinforcement Learners , 2005, ICANN.
[31] Jürgen Schmidhuber,et al. Optimal Artificial Curiosity, Creativity, Music, and the Fine Arts , 2005 .
[32] Jürgen Schmidhuber. 2006: Celebrating 75 Years of AI - History and Outlook: The Next 25 Years , 2006, 50 Years of Artificial Intelligence.
[33] Jürgen Schmidhuber,et al. New Millennium AI and the Convergence of History: Update of 2012 , 2012 .
[34] Jürgen Schmidhuber,et al. The New AI: General & Sound & Relevant for Physics , 2003, Artificial General Intelligence.
[35] Marcus Hutter,et al. On Universal Prediction and Bayesian Confirmation , 2007, Theor. Comput. Sci..
[36] P. Vitányi,et al. An Introduction to Kolmogorov Complexity and Its Applications, Third Edition , 1997, Texts in Computer Science.