Pyotr Novikov: Difference between revisions
Content deleted Content added
m Removing from Category:Russian mathematicians using Cat-a-lot |
Added reference to work on word problem Tag: Reverted |
||
| Line 2: | Line 2: | ||
'''Pyotr Sergeyevich Novikov''' ({{lang-ru|Пётр Серге́евич Но́виков}}; 15 August 1901, [[Moscow]], [[Russian Empire]] – 9 January 1975, Moscow, [[Soviet Union]]) was a [[USSR|Soviet]] [[mathematician]]. |
'''Pyotr Sergeyevich Novikov''' ({{lang-ru|Пётр Серге́евич Но́виков}}; 15 August 1901, [[Moscow]], [[Russian Empire]] – 9 January 1975, Moscow, [[Soviet Union]]) was a [[USSR|Soviet]] [[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 [[undecidable problem|undecidability]] of the word problem in groups he was awarded the [[Lenin Prize]] in 1957.<ref>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)</ref> |
Novikov is known for his work on [[combinatorial]] problems in [[group theory]]: the [[word problem for groups]],<ref>{{cite book|last=Wolfram|first=Stephen|title=A New Kind of Science|publisher=Wolfram Media, Inc.|year=2002|page=[https://www.wolframscience.com/nks/notes-12-8--word-problems/ 1141]|isbn=1-57955-008-8|url=https://www.wolframscience.com/nks/}}</ref> and [[Burnside's problem]]. For proving the [[undecidable problem|undecidability]] of the word problem in groups he was awarded the [[Lenin Prize]] in 1957.<ref>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)</ref> |
||
In 1953 he became a corresponding member of the [[USSR Academy of Sciences]] and in 1960 he was elected a full member. |
In 1953 he became a corresponding member of the [[USSR Academy of Sciences]] and in 1960 he was elected a full member. |
||
Revision as of 10:15, 25 October 2020
Pyotr Sergeyevich Novikov (
Soviet mathematician
.
Novikov is known for his work on
Burnside's problem. For proving the undecidability of the word problem in groups he was awarded the Lenin Prize in 1957.[2]
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
- ISBN 1-57955-008-8.
- 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
| International | |
|---|---|
| National | |
| Academics | |
| People | |
| Other | |
 | This article about a Russian mathematician is a stub. You can help Wikipedia by expanding it. |