On the algorithmic insolvability of the word problem in group theory

From MaRDI portal
Publication:3269139

DOI10.1090/trans2/009/01zbMath0093.01304OpenAlexW4240753253MaRDI QIDQ3269139

P. S. Novikow

Publication date: 1958

Published in: Four papers on group theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/009/01



Related Items

Decidability and independence of conjugacy problems in finitely presented monoids, Residually finite groups, The word and generator problems for lattices, Inverse monoids: decidability and complexity of algebraic questions., Linearly bounded conjugator property for mapping class groups, Can you compute the operator norm?, Twisted conjugacy in Houghton's groups, The minimal genus of homology classes in a finite 2-complex, Every finitely generated submonoid of a free monoid has a finite Malcev's presentation, Parallel Identity Testing for Skew Circuits with Big Powers and Applications, Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\), Efficient simplicial replacement of semialgebraic sets, Groups finitely presented in Burnside varieties, Compressed word problems in HNN-extensions and amalgamated products, Algorithmically finite groups., Presentations et presentations simplifiables d'un monoide simplifiable, The Poincaré Conjecture and Related Statements, Orbit decidability and the conjugacy problem for some extensions of groups, Poincaré and the early history of 3-manifolds, COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS, Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability, Some Undecidable Problems in Group Theory, Digital topological method for computing genus and the Betti numbers, Complexity classes of equivalence problems revisited, A recursive presentation for Mihailova's subgroup., Word problems, Complexity of word problems for HNN-extensions, Complexity of word problems for HNN-extensions, Unnamed Item, On equational theories, unification, and (un)decidability, Model-theoretic and algorithmic questions in group theory, Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II, Compression techniques in group theory