A FINITELY PRESENTED GROUP WITH ALMOST SOLVABLE CONJUGACY PROBLEM

DOI10.1142/S1793557109000522zbMath1207.20024MaRDI QIDQ5189964

No author found.

Publication date: 11 March 2010

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Turing machinesword problemfinitely presented groupsconjugacy problemmodular machines

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Related Items (1)

Gröbner–Shirshov bases and their calculation

Cites Work

• Recursively enumerable degress and the conjugacy problem
• Degree problems for modular machines
• The word problem

This page was built for publication: A FINITELY PRESENTED GROUP WITH ALMOST SOLVABLE CONJUGACY PROBLEM