Meta-complexity - Lecture 2 | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Meta-complexity - Lecture 2

By Antonina Kolokolova

Appears in collection : Complexity as a kaleidoscope / Le kaleidoscope de la complexité

Meta-complexity is the study of the complexity of computing hardness measures such as time-bounded versions of Kolmogorov complexity and circuit size. Here I will cover some results about complexity of computing these measures, and connections with learning theory and (time permititng) cryptography.

Information about the video

Date of recording 04/04/2025
Date of publication 14/04/2025
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers, Graduate Students
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.20341903
Cite this video Kolokolova, Antonina (04/04/2025). Meta-complexity - Lecture 2. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20341903
URL https://dx.doi.org/10.24350/CIRM.V.20341903

Domain(s)

MSC codes

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2026

Give feedback