Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
This lecture explores meta-complexity, focusing on the complexity of computing hardness measures like time-bounded Kolmogorov complexity and circuit size. Learn about key results regarding the complexity of computing these measures and discover their connections to learning theory and cryptography. Recorded during the thematic meeting "Complexity as a kaleidoscope" on April 4, 2025, at the Centre International de Rencontres Mathématiques in Marseille, France. The video features chapter markers and keywords for navigating to specific sections, and is enriched with abstracts, bibliographies, and Mathematics Subject Classification for enhanced learning. Filmed by Guillaume Hennenfent, this lecture is available in CIRM's Audiovisual Mathematics Library along with other talks by mathematicians from around the world.
