Turing degrees and the word and conjugacy problems for finitely presented groups.
From MaRDI portal
Publication:2458999
zbMath1149.20027MaRDI QIDQ2458999
Publication date: 5 November 2007
Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)
Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)
Related Items (2)
Gröbner–Shirshov bases and their calculation ⋮ Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators.
This page was built for publication: Turing degrees and the word and conjugacy problems for finitely presented groups.
