Abstract
Novikov, Boone, and Britton proved, independently, that there is a finitely presented group ℬ for which no computer can ever exist that can decide whether an arbitrary word on the generators of ℬ is 1. We shall prove this remarkable result in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Rotman, J.J. (1995). The Word Problem. In: An Introduction to the Theory of Groups. Graduate Texts in Mathematics, vol 148. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4176-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4176-8_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8686-8
Online ISBN: 978-1-4612-4176-8
eBook Packages: Springer Book Archive