Research topics: Kolmogorov complexity and algorithmic information theory, algorithmic randomness, computational complexity, tilings.
Publication list (pdf) ; publication since 2008 in doc-format ; see also selected papers, books, popular expositions online and bibliographic links DBLP (Trier University), Textbook on Kolmogorov complexity (Russian, published in 2013, minor corrections) (Work in progress): English translation MathSciNet, Google Scholar.
161 rue Ada
F-34095 Montpellier Cedex 5, France
On leave from Institute of Problems of Information Transmission (IITP RAS), Moscow.
Thésard (PhD student):