Randomness and Complexity - Lecture 1
Offered By: Centre International de Rencontres Mathématiques via YouTube
Course Description
Overview
Explore the intersection of randomness and complexity in this lecture delivered by Sylvain Perifel at the Centre International de Rencontres Mathématiques in Marseille, France. Delve into the fascinating world of discrete mathematics and computer science as part of the thematic meeting on these subjects. Gain insights from this 1 hour and 36 minute presentation, which offers a deep dive into the first lecture of the series. Access this video and other talks by renowned mathematicians through CIRM's Audiovisual Mathematics Library, taking advantage of features such as chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function. Enhance your understanding of mathematical concepts and their applications in computer science through this comprehensive lecture.
Syllabus
Sylvain Perifel: Randomness and complexity - Lecture 1
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