Computational Ergodicity of $s^4$

Abstract

It is known that there are four-manifolds which are not algorithmically recognizable. This implies that there exist triangulations of these manifolds which are separated by large barriers from the point of view of the computer algorithm. We have not observed these barriers for triangulations of $S^4$.

9 p.+4 figures (uuencoded ps-files). Latex+epsf

References in corpus (5)

• Critical Behavior of Dynamically Triangulated Quantum Gravity in Four Dimensions
• Phase Structure of Four Dimensional Simplicial Quantum Gravity
• Quantum Gravity, Dynamical Triangulation and Higer Derivative Regularization
• Noncomputability Arising In Dynamical Triangulation Model Of Four-Dimensional Quantum Gravity
• Non-uniform measure in 4d simplicial quantum gravity

Cited by in corpus (6)

• Discrete approaches to quantum gravity in four dimensions
• Further evidence that the transition of 4D dynamical triangulation is 1st order
• Singular Vertices and the Triangulation Space of the D-sphere
• Monte Carlo simulations of 4d simplicial quantum gravity
• Recent progress in the theory of random surfaces and simplicial quantum gravity
• Five Dimensional Dynamical Triangulations