Randomness and Complexity - Lecture 2
Offered By: Centre International de Rencontres Mathématiques via YouTube
Course Description
Overview
Explore the second lecture on randomness and complexity delivered by Sylvain Perifel at the Centre International de Rencontres Mathématiques in Marseille, France. Delve into this 1 hour and 26 minute conference talk, recorded during the thematic meeting on "Discrete Mathematics and Computer Science" on February 1, 2024. Gain insights into the intricate relationship between randomness and complexity in mathematical theory. Access this video and other talks by renowned mathematicians through CIRM's Audiovisual Mathematics Library, which offers enhanced features such as chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function. Benefit from the professional recording by filmmaker Guillaume Hennenfent, ensuring a high-quality viewing experience of this in-depth mathematical discourse.
Syllabus
Sylvain Perifel: Randomness and complexity - Lecture 2
Taught by
Centre International de Rencontres Mathématiques
Related Courses
Kolmogorov Complexity for DNA Sequences Analysis in PythonYacine Mahdid via YouTube Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions
Association for Computing Machinery (ACM) via YouTube Kolmogorov Music
Strange Loop Conference via YouTube Cryptography and Kolmogorov Complexity - A Quick Tutorial
Simons Institute via YouTube On One-way Functions and Kolmogorov Complexity
IEEE via YouTube