Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity

TL;DR

This paper explores a novel interpretation of quantum gravity by linking the emergence of physical phenomena to their Kolmogorov algorithmic complexity, addressing probability issues in quantum gravity through an algorithmic lens.

Contribution

It introduces a new interpretation of quantum gravity based on Kolmogorov complexity, connecting physical emergence to algorithmic complexity and redefining key quantum concepts.

Findings

Estimated the algorithmic complexity of Schwarzschild black holes

Redefined Feynman path integral using algorithmic complexity

Proposed a model for the quantum birth of the Euclidean Universe

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.