معرفی
Leonid Levin is a Professor in the College of Arts & Sciences, Department of Computer Science at Boston University since 1980, promoted to Full Professor in 1984. He holds dual PhDs from Moscow University (1972) and MIT (1979). His research focuses on computational complexity, randomness, algorithmic information theory, and foundational aspects of mathematics and computer science.
Key roles include membership in the US National Academy of Sciences (2019) and the American Academy of Arts and Sciences (2014). He has held visiting professorships at institutions such as the Institut des Hautes Études Scientifiques (France), Heidelberg University (Germany), and Hebrew University (Jerusalem).
Levin’s work bridges theoretical computer science and mathematics, with contributions to one-way functions, pseudorandomness, and Kolmogorov complexity. Notable publications include foundational papers on computational complexity and cryptography, such as A pseudorandom generator from any one-way function (1999) and The tale of one-way functions (2003).
His research interests span algorithmic randomness, fault-tolerant systems, and interdisciplinary topics like taxation and valuation. Awards include the Guggenheim Fellowship (1993-94) and recognition as a Clay Mathematics Institute Scholar (2001-2002).
