Andrey Muchnik
Muchnik Andrey Albertovich (February 24, 1958 – March 18, 2007) was a Soviet and Russian Mathematician and laureate of the A. N. Kolmogorov Prize (2006).
Andrey Muchnik | |
---|---|
![]() | |
Born | February 24, 1958 |
Died | March 18, 2007 49) | (aged
Citizenship | USSR Russia |
Alma mater | Moscow State University |
Awards | ![]() |
Scientific career | |
Fields | Mathematical logic |
Institutions | Scientific Council of the Academy of Sciences of the USSR Institute of New Technologies |
Doctoral advisor | Alexey Semyonov |
Biography
Andrey Muchnik was born on February 24, 1958.
His parents were mathematicians, and they were students of P. S. Novikov.His Father was Albert Abramovich Muchnik, who solved Post's problem - about the existence of a non-trivial enumerable degree of Turing reducibility, and his mother was Nadezhda Mitrofanovna Ermolaeva.
He entered Moscow State University, where he began working as a mathematician at the seminar of Evgenii Landis and Yulij Ilyashenko for junior students of the Faculty of Mechanics and Mathematics of Lomonosov Moscow State University. His first work, on differential equations, was done in the second year under the guidance of Yu. S. Ilyashenko.
Starting from the third year, he specialized in the definability theory at the Department of Mathematical Logic, where Alexei Semenov was his supervisor. The topic of his diploma (1981) is the solution of the problem posed by Michael Rabin at the International Congress of Mathematicians in Nice to eliminate transfinite induction in the proof of Rabin's most important theorem on the solvability of the monadic theory of infinite tree. Later, An. A. Muchnik used his approach to prove.[1] a generalization of Rabin's theorem announced by Shelah and Stupp. Using the original idea of Alfred Tarski he introduced in the notion of self-definability to obtain a short and elegant proof [TCS] of Cobham - Semenov theorem [Siber} (see also [Bes] ).
An. A. Muchnik also contributed fundamental results in the field of algorithmic information theory (Kolmogorov complexity). Many results obtained by himself and in collaboration with colleagues were published after his death. An overview of his work is contained in the obituary.[2]
He worked at the Institute of New Technologies and the Scientific Council of the USSR Academy of Sciences on the complex problem of "Cybernetics", was one of the actual leaders of the Kolmogorov seminar at Moscow State University.
Awards
Andrey was awarded the A.N. Kolmogorov Prize Laureate (together with Alexei Semenov, 2006) - for outstanding achievements in the field of mathematics for the series of works «On the refinement of A.N. Kolmogorov, related to the theory of chance».[3]
References
- Semenov, A. L. (1984). "Decidability of Monadic Theories". Mathematical Foundations of Computer Science, Praha, Czechoslovakia, September 3–7, 1984. Proceedings. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. 176: 162–175. doi:10.1007/BFb0030296. ISBN 978-3-540-38929-3.
- Адян, С. И.; Семёнов, А. Л.; Успенский, В. А. "Андрей Альбертович Мучник (некролог), УМН, 62:4(376) (2007), 140–144; Russian Math. Surveys, 62:4 (2007), 775–779". www.mathnet.ru. Retrieved 2023-01-02.
- "Nominal awards and medals". www.ras.ru.
External links
- Muchnik, Andrei Albertovich on the official website of the Russian Academy of Sciences
- Persons: Muchnik Andrey Albertovich. mathnet.ru. Retrieved 2016-3-15.
- "С. И. Адян, А. Л. Семёнов, В. А. Успенский, «Андрей Альбертович Мучник (некролог)», УМН, 62:4(376) (2007), 140–144". mathnet.ru. Retrieved 2016-03-15.