scientific article
From MaRDI portal
Publication:4012134
zbMath0752.20014MaRDI QIDQ4012134
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
normal formdecision problemsword problemcomputabilityisomorphism problemconjugacy problemrecursive functionunsolvabilityAdyan-Rabin theorem
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Recursive functions and relations, subrecursive hierarchies (03D20) Word problems, etc. in computability and recursion theory (03D40)
Related Items
Discriminating and co-discriminating groups ⋮ An application of Poénaru's ``zipping theory ⋮ Aspherical manifolds, relative hyperbolicity, simplicial volume and assembly maps. ⋮ Algorithmic recognition of infinite cyclic extensions ⋮ On the homeomorphism problem for 4-manifolds ⋮ Følner functions and the generic word problem for finitely generated amenable groups ⋮ Applying Gröbner basis techniques to group theory. ⋮ Punctual copies of algebraic structures ⋮ L 2 -Betti numbers and computability of reals ⋮ The triviality problem for profinite completions ⋮ Generic-case complexity, decision problems in group theory, and random walks. ⋮ ON THE RECOGNITION OF RIGHT-ANGLED ARTIN GROUPS ⋮ On symplectic stabilisations and mapping classes ⋮ The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable ⋮ On Constructive Nilpotent Groups ⋮ Amalgamated free product of groups: normal forms and measures. ⋮ The complexity of central series in nilpotent computable groups ⋮ Algorithmically finite groups. ⋮ The SQ-universality and residual properties of relatively hyperbolic groups. ⋮ CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM ⋮ On the Markov theorem on algorithmic nonrecognizability of manifolds ⋮ The isomorphism problem for torsion-free abelian groups is analytic complete ⋮ Friedberg splittings of recursively enumerable sets ⋮ Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups ⋮ Average-case complexity and decision problems in group theory. ⋮ Amenable groups without finitely presented amenable covers ⋮ Unrecognizability of manifolds ⋮ Finding non-trivial elements and splittings in groups. ⋮ Malnormality is undecidable in hyperbolic groups ⋮ Satisfaction of existential theories in finitely presented groups and some embedding theorems. ⋮ Groups with decidable word problem that do not embed in groups with decidable conjugacy problem ⋮ Real computational universality: the word problem for a class of groups with infinite presentation ⋮ Linear groups and computation ⋮ Detecting properties from descriptions of groups ⋮ Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings ⋮ Logspace computations in graph products ⋮ Epimorphism testing with virtually abelian targets ⋮ On decidability of amenability in computable groups ⋮ A computational approach to Shephard groups ⋮ Homological characterization of the unknot ⋮ Asymptotic invariants, complexity of groups and related problems
This page was built for publication:
