eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2007-01-31
1
20
10.4230/DagSemProc.06391.2
article
Real Computational Universality: The Word Problem for a class of groups with infinite presentation
Meer, Klaus
Ziegler, Martin
In this talk we introduce a class of groups represented as quotient groups
of some free groups generated by infinitely many elements and certain normal
subgroups. We show that the related word problem is universal in the Blum-Shub-Smale model
of computation, i.e. it has the same difficulty as the real Halting Problem.
This is the first natural example of a problem with this property.
The work has been done jointly with Martin Ziegler.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol06391/DagSemProc.06391.2/DagSemProc.06391.2.pdf
Computational group theory
word problem
Blum-Shub-Smale model