Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity

Details Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity

1995-12-07

arxiv.org/abs/gr-qc/9512014v2

Class.Quant.Grav. 15 (1998) 603

Astronomy and Astrophysics

Astrophysics

General Relativity and Quantum Cosmology

11 pages, REVTEX, some corrections in text

Scientific paper

10.1088/0264-9381/15/3/011

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.

Affiliated with

Also associated with

No associations

Rating

Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90525