Pyotr Novikov
Pyotr Sergeyevich Novikov (Russian: Пётр Серге́евич Но́виков; 28 August 1901, Moscow – 9 January 1975, Moscow) was a Soviet mathematician.
P. S. Novikov.
Novikov is known for his work on combinatorial problems in group theory: the word problem for groups, and the Burnside 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 Academy of Sciences of the Soviet Union 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.
Awards and honors
- Lenin Prize (1957)
- Two Orders of Lenin (1961, 1971)
- Order of the Red Banner of Labour
- State Prize of the Russian Federation (1999, posthumous)
See also
References
- S. I. Adian, Mathematical logic, the theory of algorithms and the theory of sets, AMS Bookstore, 1977, ISBN 0-8218-3033-3, p. 26. (being Novikov's Festschrift on the occasion of his seventieth birthday)
External links
- O'Connor, John J.; Robertson, Edmund F., "Pyotr Novikov", MacTutor History of Mathematics Archive, University of St Andrews
- Pyotr Novikov at the Mathematics Genealogy Project
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.