NONCOMPUTABILITY ARISING IN DYNAMICAL TRIANGULATION MODEL OF 4-DIMENSIONAL QUANTUM-GRAVITY

被引：22

作者：

NABUTOVSKY, A ^{[1
]}

BENAV, R ^{[1
]}

机构：

[1] PRINCETON UNIV,DEPT PHYS,PRINCETON,NJ 08544

来源：

COMMUNICATIONS IN MATHEMATICAL PHYSICS | 1993年 / 157卷 / 01期

关键词：

D O I：

10.1007/BF02098020

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

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 less-than-or-equal-to 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.

引用

页码：93 / 98

页数：6