Sergey Vsevolodovich Yablonsky
| Sergey Vsevolodovich Yablonsky | |
|---|---|
Sergey Yablonsky
|
|
| Born |
6 December 1924 Moscow, Russia |
| Died | 26 May 1998 (aged 73) Moscow, Russia |
| Residence | Russia |
| Nationality | Russian |
| Fields | Mathematics and discrete mathematics |
| Institutions |
Moscow State University |
| Alma mater | Moscow State University |
| Doctoral advisor |
Nina Bari Pyotr Novikov |
| Doctoral students | Oleg Lupanov |
| Notable awards | Lenin Prize |
Moscow State University
Steklov Institute of Mathematics
Sergey Vsevolodovich Yablonsky (Russian: Серге́й Все́володович Ябло́нский, 6 December 1924 – 26 May 1998) was a Soviet and Russian mathematician, one of the founders of the Soviet school of mathematical cybernetics and discrete mathematics. He is the author of a number of classic results on synthesis, reliability, and classification of control systems (Russian: Управляющие системы), the term used in the USSR and Russia for a generalization of finite state automata, Boolean circuits and multi-valued logic circuits. (The term is ambiguous, since conventionally in the West control systems is understood as an engineering discipline. The ambiguity stems from the fact that the names of the two disciplines that differ in Russian, namely Системы управления and Управляющие системы, are both translated into English as control systems.)
Yablonsky is credited for helping to overcome the pressure from Soviet ideologists against the term and the discipline of cybernetics and establishing what in the Soviet Union was called mathematical cybernetics as a separate field of mathematics. Yablonsky and his students were ones of the first in the world to raise the issues of potentially inherent unavoidability of the brute force search for some problems, the precursor of the P = NP problem, though Gödel's letter to von Neumann, dated 20 March 1956 and discovered in 1988, may have preceded them.
...
Wikipedia