Noncomputability Arising In Dynamical Triangulation Model Of Four-Dimensional Quantum Gravity

Abstract

Computations in Dynamical Triangulation Models of Four-Dimensional Quantum Gravity involve weighted averaging over sets of all distinct triangulations of compact four-dimensional manifolds. In order to be able to perform such computations one needs an algorithm which for any given $N$ and a given compact four-dimensional manifold $M$ constructs all possible triangulations of $M$ with $\le N$ simplices. Our first result is that such algorithm does not exist. Then we discuss recursion-theoretic limitations of any algorithm designed to perform approximate calculations of sums over all possible triangulations of a compact four-dimensional manifold.

8 Pages, LaTex, PUPT-1327

References in corpus (1)

• Critical Behavior of Dynamically Triangulated Quantum Gravity in Four Dimensions

Cited by in corpus (15)

• Discrete approaches to quantum gravity in four dimensions
• Computational complexity of the landscape I
• Scaling in four dimensional quantum gravity
• Further evidence that the transition of 4D dynamical triangulation is 1st order
• Remarks on the entropy of 3-manifolds
• On the Absence of an Exponential Bound in Four Dimensional Simplicial Gravity
• Failure of the Regge approach in two dimensional quantum gravity
• Volume dependence of the phase boundary in 4D dynamical triangulation
• Regge gravity on general triangulations
• Monte Carlo simulations of 4d simplicial quantum gravity
• Computational Ergodicity of $s^4$
• Simplicial Quantum Gravity on a Computer
• Recent progress in the theory of random surfaces and simplicial quantum gravity
• Absence of barriers in dynamical triangulation
• Dynamical Triangulation with Fluctuating Topology