Andrey Muchnik | |
|---|---|
| Born | February 24, 1958 |
| Died | March 18, 2007 (aged 49) |
| Citizenship | USSR Russia |
| Alma mater | Moscow State University |
| Awards | Kolmogorov Prize (2006) |
| Scientific career | |
| Fields | Mathematical logic |
| Institutions | Scientific Council of the Academy of Sciences of the USSR Institute of New Technologies |
| Doctoral advisor | Alexei Semyonov |
Andrey Albertovich Muchnik (February 24, 1958 – March 18, 2007) was a Soviet and Russian mathematician. He worked in the field of Mathematical logic. He was awarded the A. N. Kolmogorov Prize in 2006.
Biography
Muchnik was born on February 24, 1958, to Albert Abramovich Muchnik and Nadezhda Mitrofanovna Ermolaeva in the Soviet Union. Both parents were mathematicians and students of P. S. Novikov, a Soviet mathematician. His father, Albert Muchnik, solved Post's problem about the existence of a non-trivial enumerable degree of Turing reducibility.
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. In his second year, he published his first work on differential equations under the guidance of Ilyashenko.
From his third year at the university onwards, he specialized in definability theory at the Department of Mathematical Logic, where Alexei Semenov was his supervisor. His diploma (1981) was about 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 theorem on the solvability of the monadic theory of infinite trees. Later, 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 of Cobham-Semenov theorem. He earned his Ph.D. in 2001. [2]
Subsequently, he worked at the Institute of New Technologies and the Scientific Council of the USSR Academy of Sciences on the problem of cybernetics. Eventually, he became one of the leaders of the Kolmogorov seminar at Moscow State University.
Muchnik also contributed fundamental results in the field of algorithmic information theory. Many results obtained by himself and in collaboration with colleagues were published after his death.[3]
Awards
Andrey was awarded the A.N. Kolmogorov Prize (together with Alexei Semenov, 2006) - for his achievements in the field of mathematics for the series of works "On the refinement of A.N. Kolmogorov, related to the theory of chance".[4]
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.
- ↑ Steinhorn, Charles. "Sept 2008 Newsletter" (PDF).
- ↑ Адян, С. И.; Семёнов, А. Л.; Успенский, В. А. "Андрей Альбертович Мучник (некролог), УМН, 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.