![\"\"](\"https:\/\/mathed.bru.ac.th\/wp-content\/uploads\/2026\/08\/151-300x200.jpg\")
One of the most fundamental questions in group theory, which sounds simple but actually conceals immense complexity, is: 'How can we know if two words written from the generators of a group actually represent the same element?' This question is called the 'word problem,' and the person who proved to the world that this question does not always have a universal answer is Petr Sergeevich Novikov, a Russian mathematician born on August 15, 1901, in Moscow.<\/p>\n
Novikov was born the son of a Moscow merchant. He enrolled in the Faculty of Physics and Mathematics at Moscow University in September 1919, but his studies were interrupted when Russia fell into a civil war. In the spring of 1920, he joined the Red Army and served in the army until July 1922 before returning to his studies and graduating in 1925 under the supervision of Nikolai Luzin, a famous mathematician who founded the descriptive set theory school in Moscow.<\/p>\n
In 1929, he became a professor at the Moscow Institute of Chemical Technology, and in 1934, he joined the Steklov Institute of Mathematics, which is a leading mathematical research institute of the Soviet Union. In 1957, he established the Department of Mathematical Logic at this institute and served as the head of the department.<\/p>\n
The work that made Novikov's name immortal was his 1955 proof that the word problem for groups is, in general, unsolvable. That is, there is no universal algorithm that can always determine whether two words in a group defined by a finite set of generators and relations represent the same element. Later, in 1958, the American mathematician William Boone proved the same result using a different method, and today this result is collectively known as the Novikov\u2013Boone theorem.<\/p>\n
This theorem is extremely important because it is one of the clearest examples that show the 'limits' of what mathematics and computation can achieve. It demonstrates that even problems that appear simple in algebraic structure may not always have a feasible algorithmic solution. This result is deeply connected to computability theory and the concept of undecidability pioneered by logicians such as Kurt G\u00f6del and Alan Turing.<\/p>\n
Novikov married Lyudmila Keldysh, a mathematician specializing in topology. The couple had five children together, one of whom was Sergei Novikov, who became the first Soviet mathematician to receive the Fields Medal in 1970. This was a family of mathematicians who left significant contributions in many fields of the discipline. In addition, Novikov also had an important student, Sergei Adian, who continued research in combinatorial group theory.<\/p>\n
Petar Novikov passed away on January 9, 1975, in Moscow. His research remains a fundamental pillar of mathematical logic and combinatorial group theory to this day. It serves as a reminder that mathematics is not only for finding answers but also for understanding the limits of what can be answered.<\/p>\n