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

Klaus Meer, Martin Ziegler. Real Computational Universality: The Word Problem for a class of groups with infinite presentation. In Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub, editors, Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006. Volume 06391 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [doi]

Abstract

Abstract is missing.