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:20250417T160000
DTEND;TZID=America/New_York:20250417T170000
DTSTAMP:20260417T004243
CREATED:20250108T143958Z
LAST-MODIFIED:20250422T182732Z
UID:10003655-1744905600-1744909200@cmsa.fas.harvard.edu
SUMMARY:Fifth Annual Yip Lecture | Scott Aaronson (UT Austin): How Much Math Is Knowable?
DESCRIPTION:Speaker: Scott Aaronson\, Department of Computer Science\, University of Texas\, Austin \nScott Aaronson is the founding director at the Quantum Information Center at the University of Texas at Austin. \nDate: April 17\, 2025 \nTime: 4:00-5:00 pm ET  (Reception following in the Math Common Room) \nLocation: Harvard Science Center Hall A \n  \nTitle: How Much Math Is Knowable? \nAbstract: Theoretical computer science has over the years sought more and more refined answers to the question of which mathematical truths are knowable by finite beings like ourselves\, bounded in time and space and subject to physical laws.  I’ll tell a story that starts with Gödel’s Incompleteness Theorem and Turing’s discovery of uncomputability.  I’ll then introduce the spectacular Busy Beaver function\, which grows faster than any computable function.  Work by me and Yedidia\, along with recent improvements by O’Rear and Riebel\, has shown that the value of BB(745) is independent of the axioms of set theory; on the other end\, an international collaboration proved last year that BB(5) = 47\,176\,870.  I’ll speculate on whether BB(6) will ever be known\, by us or our AI successors.  I’ll next discuss the P!=NP conjecture and what it does and doesn’t mean for the limits of machine intelligence.  As my own specialty is quantum computing\, I’ll summarize what we know about how scalable quantum computers\, assuming we get them\, will expand the boundary of what’s mathematically knowable.  I’ll end by talking about hypothetical models even beyond quantum computers\, which might expand the boundary of knowability still further\, if one is able (for example) to jump into a black hole\, create a closed timelike curve\, or project oneself onto the holographic boundary of the universe. \n  \nThe Yip Lecture takes place thanks to the support of Dr. Shing-Yiu Yip. \n  \n\nThe previous Yip Lecture featured Josh Tenenbaum (MIT) who spoke on How to grow a mind from a brain: From guessing and betting to thinking and talking \n 
URL:https://cmsa.fas.harvard.edu/event/yip-2025/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Event,Public Lecture,Special Lectures,Yip Lecture Series
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/Yip_2025.jpg
END:VEVENT
END:VCALENDAR