Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity

Abstract

The quantum gravity has great difficulties with application of the probability notion. In given article this problem is analyzed according to algorithmic viewpoint. According to A.N. Kolmogorov, the probability notion can be connected with algorithmic complexity of given object. The paper proposes an interpretation of quantum gravity, according to which an appearance of something corresponds to its Kolmogorov's algorithmic complexity. By this viewpoint the following questions are considered: the quantum transition with supplementary coordinates splitting off, the algorithmic complexity of the Schwarzschild black hole is estimated, the redefinition of the Feynman path integral, the quantum birth of the Euclidean Universe with the following changing of the metric signature.

11 pages, REVTEX, some corrections in text

References in corpus (1)

• Discrete Strings and Deterministic Cellular Strings

Cited by in corpus (9)

• Multidimensional Geometrical Model of the Renormalized Electrical Charge with Splitting off the Extra Coordinates
• Matching Condition on the Event Horizon and the Holography Principle
• Nondifferentiable Dynamic: Two Examples
• Algorithmic Complexity in Cosmology and Quantum Gravity
• Complexity analysis for algorithmically simple strings
• Occam's Razor as a Formal Basis for a Physical Theory
• Non-differentiable Degrees of Freedom : Fluctuating Metric Signature
• Domain with Noncompactified Extra Dimensions in Multidimensional Universe with Compactified Extra Dimensions
• Algorithmic Problem Complexity