Geodesic
On the algorithmic unsolvability of the word problem in group theory
Informatics and Automation, On the algorithmic unsolvability of the word problem in group theory, Tome 44 (1955), pp. 3-143.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{TRSPY_1955_44_a0,
     author = {P. S. Novikov},
     title = {On the algorithmic unsolvability of the word problem in group theory},
     journal = {Informatics and Automation},
     pages = {3--143},
     publisher = {mathdoc},
     volume = {44},
     year = {1955},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_1955_44_a0/}
}
TY  - JOUR
AU  - P. S. Novikov
TI  - On the algorithmic unsolvability of the word problem in group theory
JO  - Informatics and Automation
PY  - 1955
SP  - 3
EP  - 143
VL  - 44
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_1955_44_a0/
LA  - ru
ID  - TRSPY_1955_44_a0
ER  - 
%0 Journal Article
%A P. S. Novikov
%T On the algorithmic unsolvability of the word problem in group theory
%J Informatics and Automation
%D 1955
%P 3-143
%V 44
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_1955_44_a0/
%G ru
%F TRSPY_1955_44_a0
P. S. Novikov. On the algorithmic unsolvability of the word problem in group theory. Informatics and Automation, On the algorithmic unsolvability of the word problem in group theory, Tome 44 (1955), pp. 3-143. http://geodesic.mathdoc.fr/item/TRSPY_1955_44_a0/