Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
From MaRDI portal
Publication:2531870
DOI10.2307/1970530zbMath0173.01301OpenAlexW2319243709MaRDI QIDQ2531870
Publication date: 1966
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970530
Related Items (17)
Unnamed Item ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Word problems and ceers ⋮ An algebraic characterization of groups with soluble word problem ⋮ Markov-Type Properties ⋮ The complexity of Grigorchuk groups with application to cryptography ⋮ Computability Theory and Differential Geometry ⋮ Recursively enumerable sets and degrees ⋮ Recursively enumerable degress and the conjugacy problem ⋮ A new non-Hopf group ⋮ On recognising properties of groups which have solvable word problem ⋮ On the complexity of reduction algorithms in Novikov-Boone constructions ⋮ On the complexity of the identity problem for finitely defined groups ⋮ Embeddings into hopfian groups ⋮ Degrees of unsolvability of the conjugacy problem for finitely-presented groups ⋮ Representation of Turing reducibility by word and conjugacy problems in finitely presented groups ⋮ Model-theoretic and algorithmic questions in group theory
This page was built for publication: Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
