Browse by author
Lookup NU author(s): Professor Sarah Rees
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
The paper is devoted to the study of groups whose word problem can be solved by a Turing machine which operates in real time. A recent result of the first author for word hyperbolic groups is extended to prove that under certain conditions the generalised Dehn algorithms of Cannon, Goodman and Shapiro, which clearly run in linear time, can be programmed on real-time Turing machines. It follows that word-hyperbolic groups, finitely generated nilpotent groups and geometrically finite hyperbolic groups all have real-time word problems.
Author(s): Rees S; Holt DF
Publication type: Article
Publication status: Published
Journal: Journal of the London Mathematical Society
ISSN (print): 0024-6107
ISSN (electronic): 1469-7750
Publisher: Oxford University Press
Altmetrics provided by Altmetric