A computer scientist's view of life, the universe, and everything
In Christian Freksa, Matthias Jantzen, and Rüdiger Valk (eds.) Foundations of Computer Science, Berlin, 1997, pp. 201–208
Abstract
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.
