scientific article; zbMATH DE number 67424
From MaRDI portal
Publication:4012134
zbMATH Open0752.20014MaRDI QIDQ4012134FDOQ4012134
Authors: Charles F. III Miller
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
normal formconjugacy problemisomorphism problemunsolvabilityword problemcomputabilitydecision problemsrecursive functionAdyan-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)
Cited In (58)
- L 2 -Betti numbers and computability of reals
- The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable
- Computable Scott sentences and the weak Whitehead problem for finitely presented groups
- Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
- Friedberg splittings of recursively enumerable sets
- On symplectic stabilisations and mapping classes
- Amalgamated free product of groups: normal forms and measures.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quid pro quo: Reflections on the value of problem structuring group workshops
- Algorithmic recognition of infinite cyclic extensions
- On decidability of amenability in computable groups
- Algorithmically finite groups.
- On Constructive Nilpotent Groups
- Finding non-trivial elements and splittings in groups.
- Malnormality is undecidable in hyperbolic groups
- Asymptotic invariants, complexity of groups and related problems.
- Introduction to the special issue ``Beliefs in groups of \textit{Theory and Decision}
- Decidable Properties of Polycyclic Groups
- Problem structuring methods for large group interventions
- Decision problems and profinite completions of groups.
- Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups
- Algorithmic theory of solvable groups
- Average-case complexity and decision problems in group theory.
- Real computational universality: the word problem for a class of groups with infinite presentation
- Punctual copies of algebraic structures
- Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
- CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM
- Følner functions and the generic word problem for finitely generated amenable groups
- Amenable groups without finitely presented amenable covers
- Viability of decision-making systems in human and animal groups
- Satisfaction of existential theories in finitely presented groups and some embedding theorems.
- Applying Gröbner basis techniques to group theory.
- Title not available (Why is that?)
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
- The isomorphism problem for torsion-free abelian groups is analytic complete
- An application of Poénaru's ``zipping theory
- Title not available (Why is that?)
- Linear groups and computation
- The SQ-universality and residual properties of relatively hyperbolic groups.
- ON THE RECOGNITION OF RIGHT-ANGLED ARTIN GROUPS
- Unsolvable Problems About Small Cancellation and Word Hyperbolic Groups
- Unrecognizability of manifolds
- Logspace computations in graph products
- The complexity of central series in nilpotent computable groups
- The triviality problem for profinite completions
- Aspherical manifolds, relative hyperbolicity, simplicial volume and assembly maps.
- Title not available (Why is that?)
- Epimorphism testing with virtually abelian targets
- Title not available (Why is that?)
- Homological characterization of the unknot
- Search and witness problems in group theory.
- Generic-case complexity, decision problems in group theory, and random walks.
- Detecting properties from descriptions of groups
- A computational approach to Shephard groups
- Discriminating and co-discriminating groups
- On the Markov theorem on algorithmic nonrecognizability of manifolds
- On the homeomorphism problem for 4-manifolds
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012134)