Real Computational Universality: The Word Problem for a class of groups with infinite presentation

Details Real Computational Universality: The Word Problem for a class of groups with infinite presentation Real Computational Universality: The Word Problem for a class of groups with infinite presentation

2006-04-07

arxiv.org/abs/cs/0604032v3

Computer Science

Logic in Computer Science

corrected Section 4.5

Scientific paper

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 of real numbers. This allows to include many mathematically important groups which are not captured in the framework of the classical word problem. Our contribution extends computational group theory from the discrete to the Blum-Shub-Smale (BSS) model of real number computation. We believe this to be an interesting step towards applying BSS theory, in addition to semi-algebraic geometry, also to further areas of mathematics. The main result establishes the word problem for such groups to be not only semi-decidable (and thus reducible FROM) but also reducible TO the Halting Problem for such machines. It thus provides the first non-trivial example of a problem COMPLETE, that is, computationally universal for this model.

Affiliated with

Also associated with

No associations

Rating

Real Computational Universality: The Word Problem for a class of groups with infinite presentation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Real Computational Universality: The Word Problem for a class of groups with infinite presentation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Real Computational Universality: The Word Problem for a class of groups with infinite presentation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-589765