The Library
Solving the word problem in real time
Tools
Holt, Derek F. and Rees, Sarah (2001) Solving the word problem in real time. Journal of the London Mathematical Society, Vol.63 (No.3). pp. 623-639. doi:10.1017/S0024610701002083 ISSN 0024-6107 .
|
PDF
WRAP_Holt_Solving_word_problem.pdf - Requires a PDF viewer. Download (301Kb) |
Official URL: http://dx.doi.org/10.1017/S0024610701002083
Abstract
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.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Library of Congress Subject Headings (LCSH): | Turing machines, Word problems (Mathematics), Group theory, Automorphisms | ||||
Journal or Publication Title: | Journal of the London Mathematical Society | ||||
Publisher: | Cambridge University Press | ||||
ISSN: | 0024-6107 | ||||
Official Date: | June 2001 | ||||
Dates: |
|
||||
Volume: | Vol.63 | ||||
Number: | No.3 | ||||
Page Range: | pp. 623-639 | ||||
DOI: | 10.1017/S0024610701002083 | ||||
Status: | Peer Reviewed | ||||
Access rights to Published version: | Open Access (Creative Commons) |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year