BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20251203T170000
DTEND;TZID=America/New_York:20251203T180000
DTSTAMP:20260422T095747
CREATED:20250409T160258Z
LAST-MODIFIED:20251205T171720Z
UID:10003659-1764781200-1764784800@cmsa.fas.harvard.edu
SUMMARY:Millennium Prize Problems Lecture - Madhu Sudan: P vs NP Problem
DESCRIPTION:Pamphlet (pdf) \nSlides (pdf) \nDate: December 3\, 2025 \nTime: 5:00–6:00 pm \nLocation: Harvard Science Center Hall D\, 1 Oxford St.\, Cambridge MA \nSpeaker: Madhu Sudan\, Harvard University \nTitle: The P vs. NP problem: An Existential Question for Mathematics \nAt the beginning of the twentieth century\, in response to questions raised by Hilbert\, illustrious mathematicians such as Godel\, Church and Turing formalized the notion of theorems and proofs. Proofs were automatically verifiable while theorems are logical propositions for which proofs exist. The formal definition of a computer\, a definition that had strong influence on the later development of the technology\, was a by-product of the effort to define the phrase “automatically verifiable”! \nWhile the resulting theory had major implications already\, one notion was however missing in the early definitions. Proofs were meant to be easily verifiable\, while determining the truth of a proposition/conjecture (arguably a core task of mathematics) was not necessarily so. But what is “easiness” and how is it to be defined? While this was already hinted at by Godel in the 50s\, the notion was finally formalized in seminal works of Cook\, Levin and Karp in the early 70s. Central notions here included the adoption of the notion that polynomial time algorithms are (the only) tractable ones\, and the realization that algorithms seeking to remove the existential quantifier in the definition of a “theorem” lead naively to exponential time algorithms. But are there no sophisticated algorithms to search for proofs? This is the profound “Is P = NP?” question. \nIn this talk we will introduce the question and explain implications of resolutions of this question to the modern computing infrastructure\, to mathematics and other sciences. We will briefly describe the state of progress on this question and recent progress on weaker forms of this question. Finally we will also aim to connect this question\, and why one may believe that P != NP (proof search can not be automated) even in the face of accumulating evidence on the ability of computers to solve more and more complex mathematical problems\, which seem to implement brute force search in less than polynomial time. \n  \nRead more about the P vs NP Problem at the Clay Math website. \n  \nOrganizers: Martin Bridson\, Clay Mathematics Institute | Dan Freed\, Harvard University and CMSA | Mike Hopkins\, Harvard University \n\n                   \n\nMillennium Prize Problems Lecture Series
URL:https://cmsa.fas.harvard.edu/event/clay_12325/
LOCATION:Harvard Science Center Hall D\, 1 Oxford Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Millennium Prize Problems Lecture,Special Lectures
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/Sudan_web-ad_CROP-scaled.jpg
END:VEVENT
END:VCALENDAR