Complexity as a kaleidoscope / Le kaleidoscope de la complexité

Collection Complexity as a kaleidoscope / Le kaleidoscope de la complexité

Organizer(s) Bredariol Grilo, Alex ; Fijalkow, Joanna ; Huiberts, Sophie ; Rezende, Susanna ; Seiller, Thomas

Date(s) 31/03/2025 - 04/04/2025

linked URL https://conferences.cirm-math.fr/3225.html

00:00:00 / 00:00:00

5 6

Meta-complexity - Lecture 2

By Antonina Kolokolova

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

All the collection videos

01:14:15

published on April 14, 2025

Quantum information and complexity - Lecture 1

By Richard Kueng

01:13:33

published on April 14, 2025

Meta-complexity - Lecture 1

By Antonina Kolokolova

01:16:03

published on April 14, 2025

Quantum information and complexity - Lecture 2

By Richard Kueng

01:01:53

published on April 14, 2025

Quantum information and complexity - Lecture 3

By Richard Kueng

01:11:52

published on April 14, 2025

Meta-complexity - Lecture 2

By Antonina Kolokolova

01:09:23

published on April 15, 2025

Meta-complexity - Lecture 3

By Antonina Kolokolova

Copyright Carmin.tv 2025

Give feedback