Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation

DOI10.1007/978-3-540-74456-6_64zbMath1147.20308OpenAlexW1697302963MaRDI QIDQ3525615

Klaus Meer, Martin Ziegler

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_64

zbMATH Keywords

Turing machinesword problemcomputational group theorydiscrete halting problemgroups generated by uncountably many generators

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Undecidability and degrees of sets of sentences (03D35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Turing machines and related notions (03D10)