4 research outputs found
Noncomputability Arising In Dynamical Triangulation Model Of Four-Dimensional Quantum Gravity
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 and a given compact
four-dimensional manifold constructs all possible triangulations of
with 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.Comment: 8 Pages, LaTex, PUPT-132
A Minimal Periods Algorithm with Applications
Kosaraju in ``Computation of squares in a string'' briefly described a
linear-time algorithm for computing the minimal squares starting at each
position in a word. Using the same construction of suffix trees, we generalize
his result and describe in detail how to compute in O(k|w|)-time the minimal
k-th power, with period of length larger than s, starting at each position in a
word w for arbitrary exponent and integer . We provide the
complete proof of correctness of the algorithm, which is somehow not completely
clear in Kosaraju's original paper. The algorithm can be used as a sub-routine
to detect certain types of pseudo-patterns in words, which is our original
intention to study the generalization.Comment: 14 page