|
|
| Line 1: |
Line 1: |
| {{Infobox scientist
| | Andrew Simcox is the title his mothers and fathers gave him and he completely loves this name. Mississippi is the only location I've been residing in but I will have to transfer in a yr or two. As a woman what she truly likes is style and she's been doing it for quite a whilst. Office supervising is my occupation.<br><br>Here is my homepage best [http://mybrandcp.com/xe/board_XmDx25/107997 free psychic] [http://www.familysurvivalgroup.com/easy-methods-planting-looking-backyard/ love psychic readings]; [http://findyourflirt.net/index.php?m=member_profile&p=profile&id=117823 findyourflirt.net], |
| | name = Sergey Vsevolodovich Yablonsky
| |
| | image = Sergey Vsevolodovich Yablonsky.jpg
| |
| | image_size = 170px
| |
| | caption = Photographer unknown
| |
| | birth_date = {{birth date|1924|12|6|df=y}}
| |
| | birth_place = [[Moscow]], [[Russia]]
| |
| | death_date = {{death date and age|1998|5|26|1924|12|6|df=y}}
| |
| | death_place = Moscow, Russia
| |
| | residence =
| |
| [[Soviet Union]]<br>
| |
| [[Russia]]
| |
| | nationality =[[Russia]]n
| |
| | field = [[Mathematics]] and [[discrete mathematics]]
| |
| | work_institution = [[Moscow State University]]<br>
| |
| [[Steklov Institute of Mathematics]]<br>
| |
| [[Keldysh Institute of Applied Mathematics|Institute of Applied Mathematics]]
| |
| | alma_mater = [[Moscow State University]]
| |
| | doctoral_advisor = [[Nina Bari]]<br> [[Pyotr Novikov]]
| |
| | doctoral_students = [[Oleg Lupanov]]
| |
| }}
| |
| <!-- FAIR USE of Sergey Vsevolodovich Yablonsky.jpg: see image description page at http://en.wikipedia.org/wiki/Image:Sergey Vsevolodovich Yablonsky.jpg for rationale -->
| |
| '''Sergey Vsevolodovich Yablonsky''' ([[Russian language|Russian]]: Серге́й Все́володович Ябло́нский, 6 December 1924 – 26 May 1998) was a [[Soviet Union|Soviet]] and [[Russia]]n [[mathematician]], one of the founders of the Soviet school of [[cybernetics|mathematical cybernetics]] and [[discrete mathematics]]. He is the author of a number of classic results on synthesis, reliability, and classification of [[control systems]] ({{lang-ru|Управляющие системы}}), the term used in the [[Soviet Union|USSR]] and [[Russia]] for a generalization of [[finite state automata]], [[Boolean circuits]] and [[multi-valued logic|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 [[Suppressed research in the Soviet Union#Cybernetics|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 [[Kurt Gödel|Gödel]]'s letter to [[John von Neumann|von Neumann]], dated 20 March 1956 and discovered in 1988, may have preceded them.<ref>Sipser, M. (1992), The history and status of the P versus NP question, in ‘Proceedings of the 24th Annual ACM Symposium on the Theory of Computing’, pp. 603–618.</ref>
| |
| | |
| {{Quotation|In Russia, a group led by Yablonsky had the idea that combinatorial problems are hard in proportion to the amount of brute-force search required to find a solution. In particular, they noticed that for many problems they could not find a useful way to organize the space of potential solutions so as to avoid brute force search. They began to suspect that these problems had an ''inherently'' unorganized solution space, and the best method for solving them would require enumerating an exponential (in the size of the problem instance) number of potential solutions. That is, the problems seem to require <math>c^n</math> "shots in the dark" (for some constant <math>c</math>) when the length of the problem description is <math>n</math>. However, despite their "leading-edge" taste in mathematics, Yablonsky's group never quite formulated this idea precisely.|[[Steven Rudich]]<ref>Computational Complexity Theory (2004), [[Steven Rudich]], [[Avi Widgerson]], Editors, [[American Mathematical Society]], page 12.</ref>}}
| |
| | |
| <!-- FAIR USE of Sergey Vsevolodovich Yablonsky2.jpg: see image description page at http://en.wikipedia.org/wiki/Image:Sergey Vsevolodovich Yablonsky2.jpg for rationale -->
| |
| | |
| [[Image:Sergey Vsevolodovich Yablonsky2.jpg|thumb|250px|]]
| |
| | |
| == Biography ==
| |
| | |
| === Childhood ===
| |
| Yablonsky was born in [[Moscow]], to the family of a professor of mechanics. His mathematical talents became apparent in early age. In 1940 he became the winner of the sixth Moscow secondary school [[mathematical olympiad]].<ref>История информатики в России. Ученые и их школы. Сергей Всеволодович Яблонский (2003) [http://www.computer-museum.ru/galglory/yablons1.htm], Валерий Борисович Алексеев, Nauka Publishers, page 241.</ref>
| |
| | |
| === War ===
| |
| In August 1942, after completing his first year at [[Moscow State University]]'s [[MSU Faculty of Mechanics and Mathematics|Faculty of Mechanics and Mathematics]], Yablonsky, then 17, went to serve in the [[Soviet Army]], fighting in the [[Eastern Front (World War II)|second world war]] as a member of the tank brigade 242. For his service he was awarded two [[Order of the Patriotic War|Orders of the Patriotic War]], two [[Order of the Red Star|Orders of the Red Star]], [[Order of Glory]] of the 3rd class, and numerous medals. He returned to his study after the war has ended in 1945 and went on to graduate with distinction.
| |
| | |
| === Post-war period ===
| |
| | |
| Yablonsky graduated the [[MSU Faculty of Mechanics and Mathematics|Faculty of Mechanics and Mathematics]] of Moscow State University in 1950. During his student years he worked under supervision of [[Nina Bari]]. This collaboration resulted in his first research paper, "On the converging sequences of continuous functions" (1950).
| |
| | |
| He joined the graduate program of the [[MSU Faculty of Mechanics and Mathematics|Faculty of Mechanics and Mathematics]] in 1950 where his advisor was [[Pyotr Novikov]]. There Yablonsky's research was on the issues of the expressibility in mathematical logic. He approached this problem in terms of the theory of [[Multi-valued logic|k-valued discrete functions]]. Among the problems that were addressed in his PhD thesis titled "Issues of functional completeness in k-valued calculus" (1953) is the definitive answer to the question of completeness in 3-valued logic.
| |
| | |
| Starting from 1953, Yablonsky worked at the Department of Applied Mathematics of [[Steklov Institute of Mathematics]], that in 1966 became the separate [[Keldysh Institute of Applied Mathematics|Institute of Applied Mathematics]]. Over the period of 1950s and 1960s, together with [[Alexey Lyapunov]], Yablonsky organized the seminar on cybernetics, showing his support to the new field of mathematics that had been a subject of a significant [[Suppressed research in the Soviet Union#Cybernetics|controversy]] fueled by Soviet ideologists. He actively participated in the creation of the periodical publication Problems of Cybernetics, with Lyapunov as its first editor-in-chief. Yablonsky succeeded Lyapunov as the editor-in-chief of Problems of Cybernetics in 1974 (the publication changed its name to Mathematical Issues of Cybernetics in 1989). In 1966 Yablonsky (together with [[Yuriy Zhuravlev]] and [[Oleg Lupanov]]) was awarded [[Lenin Prize]] for their work on the theory of control systems (in the discrete-mathematical sense, as explained above). In 1968 Yablonsky was elected a corresponding member of the [[Soviet Academy of Sciences|Academy of Sciences of the Soviet Union]] (division of mathematics).
| |
| | |
| Yablonsky played an active role in the creation of the [[MSU Faculty of Computational Mathematics and Cybernetics|Faculty of Computational Mathematics and Cybernetics]] at [[Moscow State University]] in 1970. In 1971 he became the founding head of the department of mathematical cybernetics (initially department of [[automata theory]] and [[mathematical logic]]) at the [[MSU Faculty of Computational Mathematics and Cybernetics|Faculty of Computational Mathematics and Cybernetics]].<ref>Biography of S. V. Yablonsky at the website of the department of Mathematical Cybernetics, Moscow State University [http://mathcyb.cs.msu.su/history.html]</ref>
| |
| | |
| ==References== | |
| {{reflist}}
| |
| | |
| {{Persondata
| |
| | NAME = Yablonsky, Sergey
| |
| | ALTERNATIVE NAMES =
| |
| | SHORT DESCRIPTION = Russian mathematician
| |
| | DATE OF BIRTH = 6 December 1924
| |
| | PLACE OF BIRTH = [[Moscow]], [[Russia]]
| |
| | DATE OF DEATH = 26 May 1998
| |
| | PLACE OF DEATH = Moscow, Russia
| |
| }}
| |
| {{DEFAULTSORT:Yablonsky, Sergey}}
| |
| [[Category:1924 births]]
| |
| [[Category:1998 deaths]]
| |
| [[Category:Corresponding Members of the USSR Academy of Sciences]]
| |
| [[Category:Corresponding Members of the Russian Academy of Sciences]]
| |
| [[Category:Moscow State University alumni]]
| |
| [[Category:Moscow Institute of Physics and Technology faculty]]
| |
| [[Category:Russian computer scientists]]
| |
| [[Category:Russian mathematicians]]
| |
| [[Category:Soviet computer scientists]]
| |
| [[Category:Soviet mathematicians]]
| |
Andrew Simcox is the title his mothers and fathers gave him and he completely loves this name. Mississippi is the only location I've been residing in but I will have to transfer in a yr or two. As a woman what she truly likes is style and she's been doing it for quite a whilst. Office supervising is my occupation.
Here is my homepage best free psychic love psychic readings; findyourflirt.net,