论文信息 - A Computer Scientist's View of Life, the Universe, and Everything

A Computer Scientist's View of Life, the Universe, and Everything

Is the universe computable? If so, it may be much cheaper in terms of information requirements to compute all computable universes instead of just ours. I apply basic concepts of Kolmogorov complexity theory to the set of possible universes, and chat about perceived and true randomness, life, generalization, and learning in a given universe.

Jürgen Schmidhuber | J. Schmidhuber

[1] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.

[2] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[3] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[4] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .

[5] Leonid A. Levin,et al. Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..

[6] Gregory. J. Chaitin,et al. Algorithmic information theory , 1987, Cambridge tracts in theoretical computer science.

[7] Gregory J. Chaitin,et al. Algorithmic Information Theory , 1987, IBM J. Res. Dev..

[8] David H. Wolpert,et al. The Lack of A Priori Distinctions Between Learning Algorithms , 1996, Neural Computation.

[9] Corso Elvezia,et al. Discovering Neural Nets with Low Kolmogorov Complexity and High Generalization Capability , 1997 .

[10] Jürgen Schmidhuber,et al. Reinforcement Learning with Self-Modifying Policies , 1998, Learning to Learn.