Algorithmic complexity in cosmology and quantum gravity
Summary: In this article we use the idea of algorithmic complexity (AC) to study various cosmological scenarios, and as a means of quantizing the gravitational interaction. We look at 5D and 7D cosmological models where the Universe begins as a higher dimensional Planck size spacetime which fluctuates between Euclidean and Lorentzian signatures. These fluctuations are overned by the AC of the two different signatures. At some point a transition to a 4D Lorentzian signature Universe occurs, with the extra dimensions becoming ``frozen or non-dynamical. We also apply the idea of algorithmic complexity to study composite wormholes, the entropy of black holes, and the path integral for quantum gravity. Some of the physical consequences of the idea presented here are: the birth of the Universe with a fluctuating metric signature; the transition from a fluctuating metric signature to Lorentzian one; ``frozen extra dimensions as a consequence of this transition; quantum handles in the spacetime foam as regions with multidimensional gravity.
- Kolmogorov's algorithmic complexity and its probability interpretation in quantum gravity
- Nondifferentiable dynamics: Two examples
- Computational complexity of the landscape. II: Cosmological considerations
- Entropic locking of action complexity at cosmological singularities
- Tunnelling with a negative cosmological constant
- A small cosmological constant from a large extra dimension
- Black hole explosions?
- Kolmogorov's algorithmic complexity and its probability interpretation in quantum gravity
- Matching condition on the event horizon and holography principle
- Nondifferentiable dynamics: Two examples
- Primordial black holes: pair creation, Lorentzian condition, and evaporation
- Quantum gravity as a dissipative deterministic system
- Wormhole with a quantum throat
- Computational complexity of the landscape. II: Cosmological considerations
- Algorithmic complexity of a Schwartzschild black hole
- Kolmogorov's algorithmic complexity and its probability interpretation in quantum gravity
- A holographic bound on the total number of computations in the visible universe
- scientific article; zbMATH DE number 7055521 (Why is no real title available?)
- Nondifferentiable dynamics: Two examples
This page was built for publication: Algorithmic complexity in cosmology and quantum gravity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613112)