A finitely presented group with almost solvable conjugacy problem.
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10) Recursively (computably) enumerable sets and degrees (03D25) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Recommendations
- Turing degrees and the word and conjugacy problems for finitely presented groups.
- Computational complexity and the conjugacy problem
- The conjugacy problem for groups, and Higman embeddings
- A finitely presented simple group with unsolvable conjugacy problem
- The conjugacy problem and Higman embeddings
Cites work
Cited in
(14)- Decision problems, complexity, traces, and representations
- Turing degrees and the word and conjugacy problems for finitely presented groups.
- Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
- SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
- scientific article; zbMATH DE number 3929284 (Why is no real title available?)
- scientific article; zbMATH DE number 18966 (Why is no real title available?)
- Computational complexity and the conjugacy problem
- The conjugacy problem for groups, and Higman embeddings
- Novikov groups are right-orderable
- Gröbner-Shirshov bases and their calculation
- Decidability problem for exponential equations in finitely presented groups
- Conjugacy in Miller's groups
- Finding non-trivial elements and splittings in groups.
- A finitely presented simple group with unsolvable conjugacy problem
This page was built for publication: A finitely presented group with almost solvable conjugacy problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189964)
