The Full Wiki

More info on Pyotr Novikov

Pyotr Novikov: Wikis

Advertisements

Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.

Encyclopedia

From Wikipedia, the free encyclopedia

P. S. Novikov.

Pyotr Sergeyevich Novikov (Russian: Пётр Сергеевич Новиков; 15 August 1901, Moscow, Russia – 9 January 1975, Moscow, USSR) was a Russian mathematician.

Novikov is known for his work on combinatorial problems in group theory: the word problem for groups, and Burnside's problem. For proving the undecidability of the word problem in groups he was awarded the Lenin Prize in 1957.[1]

In 1953 he became a corresponding member of the USSR Academy of Sciences and in 1960 he was elected a full member.

He was married to the mathematician Lyudmila Keldysh (1904–1976). The mathematician Sergei Novikov is his son. Sergei Adian and Albert Muchnik were among his students.

References

  1. ^ S. I. Adian, Mathematical logic, the theory of algorithms and the theory of sets, AMS Bookstore, 1977, ISBN 0821830333, p. 26.

External links


Advertisements






Got something to say? Make a comment.
Your name
Your email address
Message