Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity

DOI10.1007/BF02098020zbMath0785.53065arXivhep-lat/9208014OpenAlexW3101993535MaRDI QIDQ1311693

Radel Ben-Av, Alexander Nabutovsky

Publication date: 21 January 1994

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/hep-lat/9208014

zbMATH Keywords

dynamical triangulationfour-dimensional Quantum Gravity

Mathematics Subject Classification ID

Applications of differential geometry to physics (53Z05) Lattice gravity, Regge calculus and other discrete methods in general relativity and gravitational theory (83C27) Quantum stochastic calculus (81S25)

Related Items

Scaling in four-dimensional quantum gravity, Simplicial quantum gravity on a computer, Computational complexity of the landscape. I., Geometry of the space of triangulations of a compact manifold, Discrete approaches to quantum gravity in four dimensions, Monte Carlo simulations of 4d simplicial quantum gravity, Remarks on the entropy of \(3\)-manifolds, Is there an exponential bound in four-dimensional simplicial gravity?

Cites Work

• Unnamed Item
• Unnamed Item
• Effectiveness - non effectiveness in semialgebraic and PL geometry
• Algorithmic entropy of sets
• THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
• Undecidability principle and the uncertainty principle even for classical systems
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Scaling properties of randomly triangulated planar random surfaces: A numerical study
• Analytical and numerical study of a model of dynamically triangulated random surfaces