Meta-complexity - Lecture 1

Explore the fascinating field of meta-complexity in this lecture by Antonina Kolokolova, recorded during the thematic meeting "Complexity as a kaleidoscope" at the Centre International de Rencontres Mathématiques (CIRM) in Marseille, France. Delve into the study of complexity of computing hardness measures, including time-bounded versions of Kolmogorov complexity and circuit size. Learn about the results concerning the complexity of computing these measures and discover their connections with learning theory and cryptography. This 1-hour and 14-minute presentation is part of CIRM's Audiovisual Mathematics Library, which offers additional features such as chapter markers, keywords, abstracts, bibliographies, and Mathematics Subject Classification to enhance the learning experience.