Algorithmic Theories of Everything
arXiv:quant-ph/0011122
Abstract
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong inductive bias. We show that P(x) is small for any universe x lacking a short description, and study the spectrum of TOEs spanned by two Ps, one reflecting the most compact constructive descriptions, the other the fastest way of computing everything. The former derives from generalizations of traditional computability, Solomonoff's algorithmic probability, Kolmogorov complexity, and objects more random than Chaitin's Omega, the latter from Levin's universal search and a natural resource-oriented postulate: the cumulative prior probability of all x incomputable within time t by this optimal algorithm should be 1/t. Between both Ps we find a universal cumulatively enumerable measure that dominates traditional enumerable measures; any such CEM must assign low probability to any universe lacking a short enumerating program. We derive P-specific consequences for evolving observers, inductive reasoning, quantum physics, philosophy, and the expected duration of our universe.
10 theorems, 50 pages, 100 refs, 20000 words. Minor revisions: added references; improved readability
References in corpus (3)
Cited by in corpus (25)
- The Beginning and the End: The Meaning of Life in a Cosmological Perspective
- A Complete Theory of Everything (will be subjective)
- Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements
- Why Occam's Razor
- Reinforcement Learning Upside Down: Don't Predict Rewards -- Just Map Them to Actions
- Optimal Ordered Problem Solver
- Algorithmic Complexity Bounds on Future Prediction Errors
- The informational physics indeed can help to understand Nature?
- Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
- A Representation of Real and Complex Numbers in Quantum Theory
- "The Information as Absolute" Concept and Basic Physics
- A Minimal Active Inference Agent
- Constraints on physical reality arising from a formalization of knowledge
- The importance of the observer in science
- On Generalized Computable Universal Priors and their Convergence
- Sequential Predictions based on Algorithmic Complexity
- The Computational Status of Physics: A Computable Formulation of Quantum Theory
- Applications of Algorithmic Probability to the Philosophy of Mind
- The Fastest and Shortest Algorithm for All Well-Defined Problems
- Nonparametric Bayesian Classification
- The Relativity of Existence
- On Semimeasures Predicting Martin-Loef Random Sequences
- Sequence Prediction based on Monotone Complexity
- An effective Procedure for Speeding up Algorithms
- The Relativity of Induction