On the algorithmic unsolvability of the word problem in group theory
Article
Domain Context
Computation and Complexity
Citation
P. S. Novikov. (1955). On the algorithmic unsolvability of the word problem in group theory. Trudy Matematicheskogo Instituta imeni V. A. Steklova.
Why this reference is included
Novikov’s On the algorithmic unsolvability of the word problem in group theory (1955) is part of the program’s reference corpus as standard domain context for Computation and Complexity. It is not directly cited in the currently published volumes of Panta Rhei, but is retained as part of the research shelf.
Corpus status
In the corpus only This reference is part of the research corpus but is not directly cited in the currently published volumes of Panta Rhei.