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

DOI10.1007/978-3-540-74456-6_64MaRDI QIDQ3525615zbMATH OpenOpenAlexFDO

Authors 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

computational group theorydiscrete halting problemgroups generated by uncountably many generatorsTuring machinesword problem

Mathematics Subject Classification ID

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

Recommendations

• Real computational universality: the word problem for a class of groups with infinite presentation
• Logical Approaches to Computational Barriers
• The word and order problems for self-similar and automata groups
• scientific article; zbMATH DE number 67424
• An introduction to computable model theory on groups and fields

Cited in

(2)

• Logical Approaches to Computational Barriers
• Real computational universality: the word problem for a class of groups with infinite presentation

This page was built for publication: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525615)