The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Real Computational Universality: The Word Problem for a class of groups with infinite presentation
[article]

2006
*
arXiv
*
pre-print

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real extension of the word problem for a certain class of groups which are presented as quotient groups of a free group and a normal subgroup. Most important, the free group will be generated by an uncountable set of generators with index running over certain sets

arXiv:cs/0604032v3
fatcat:jiek7okaebh6zndat5ikmfm55m