Kolmogorov's algorithmic complexity and its probability interpretation in quantum gravity

DOI10.1088/0264-9381/15/3/011zbMath0916.68077arXivgr-qc/9512014OpenAlexW2075711321MaRDI QIDQ4240788

Vladimir Dzhunushaliev

Publication date: 29 June 1999

Published in: Classical and Quantum Gravity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/gr-qc/9512014

zbMATH Keywords

quantum gravity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantization of the gravitational field (83C45)

Related Items (4)

Algorithmic complexity in cosmology and quantum gravity ⋮ MATCHING CONDITION ON THE EVENT HORIZON AND HOLOGRAPHY PRINCIPLE ⋮ Nondifferentiable dynamics: Two examples ⋮ Domain with noncompactified extra dimensions in the multidimensional universe with compactified extra dimensions

This page was built for publication: Kolmogorov's algorithmic complexity and its probability interpretation in quantum gravity