Kolmogorov Algorithmic Complexity and Its Probability Interpretation in Quantum Gravity

The quantum gravity has great difficulty with introduction the probability notion. In given article this problem is analyzed according algorithmic point of view. According Kolmogorov the probability notion can connecte with algorithmic complexity of given object (for example, Universe). The given paper is devoted to such an conception of quantum gravity according to which an appearance of something corresponds to its Kolmogorov algorithmic complexity. By this viewpoint the following questions are considered: the definition of the Feynman path integral, the quantum birth of the Euclidean Universe with the following change of the metric signature, the quantum transition with the supplementary coordinates splitting off and the algorithmic complexity of the Schwarzschield black hole is estimated. PACS N 02.90.+p, 04.60.-m 1 Introduction The fundamental difficulties connected with probability interpretation of wave-function of the Wheeler - deWitt equation is well known in quantum gravity ..