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.
KeywordsShort Program Input Tape Universal Turing Machine Great Programmer Code Theorem
Unable to display preview. Download preview PDF.
- 1.G.J. Chaitin. Algorithmic Information Theory. Cambridge University Press, Cambridge, 1987.Google Scholar
- 3.L. A. Levin. Laws of information (nongrowth) and aspects of the foundation of probability theory. Problems of Information Transmission, 10(3):206–210, 1974.Google Scholar
- 5.J. Schmidhuber. Discovering neural nets with low Kolmogorov complexity and high generalization capability. Neural Networks, 1997. In press.Google Scholar
- 6.J. Schmidhuber, J. Zhao, and N. Schraudolph. Reinforcement learning with selfmodifying policies. In S. Thrun and L. Pratt, editors, Learning to learn. Kluwer, 1997. To appear.Google Scholar
- 7.J. Schmidhuber, J. Zhao, and M. Wiering. Shifting inductive bias with successstory algorithm, adaptive Levin search, and incremental self-improvement. Machine Learning, 26, 1997. In press.Google Scholar
- 10.D. H. Wolpert. The lack of a priori distinctions between learning algorithms. Neural Computation, 8(7):1341–1390, 1996.Google Scholar