Editing Pyotr Novikov (section)

==Research==
Novikov is known for his work on [[Combinatorics|combinatorial]] problems in [[group theory]]: the [[word problem for groups]], and his progress in the [[Burnside problem]].<ref name="MacTutor1"/> In 1955, he proved the [[Novikov–Boone theorem]]: that there is a finite [[presentation of a group]]  {{math|⟨''S'' {{!}} ''R''⟩}} for which there is no algorithm which, given two words ''u'', ''v'', decides whether ''u'' and ''v'' describe the same element in the group.<ref>{{Citation|last=Novikov|first=Pyotr S.|author-link=Pyotr Novikov|year=1955|title=On the algorithmic unsolvability of the word problem in group theory|language=ru| zbl=0068.01301 | journal=[[Proceedings of the Steklov Institute of Mathematics]]|volume=44|pages=1–143}}</ref>