Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Attend this keynote lecture and panel discussion from the 2025 Fields Medal Symposium featuring Dr. Mark Braverman, the 2022 Abacus Medal recipient from Princeton University, who explores the fundamental question "How do you measure surprise?" in computational complexity theory. Discover insights into information theory, computational complexity, and the mathematical frameworks used to quantify uncertainty and surprise in algorithmic processes. Engage with cutting-edge research through the subsequent panel discussion where Braverman joins Matt Weinberg from Princeton University and Rotem Oshman from Tel Aviv University to discuss the broader implications of measuring surprise in computer science, theoretical foundations of computational complexity, and current developments in algorithmic information theory. Gain exposure to advanced mathematical concepts at the intersection of computer science and mathematics while learning from leading researchers who are shaping the future of computational theory and its applications to understanding information, randomness, and complexity in computational systems.
