Scott Aaronson | How Much Math Is Knowable?
Channel:Harvard CMSA · Length:1:06:43 · Published:2025-04-22 · Views:58093
Summary
Scott Aaronson's Harvard CMSA talk traces what mathematical truths are knowable, from Godel and Turing to the Busy Beaver function. He covers recent work on Busy Beaver values.
Why HN recommends it
Pointed to in Busy Beaver threads as an accessible expert talk on the topic.
I learned about it in this Scott Aaronson talk, — HN, 2025
Computability & complexity theory · Logic & formal methods
Subtitles (excerpt)
- Good afternoon, I'm Dan Freed, Director of the Harvard CMSA. We're a center on campus that's engaged in mathematics in two-way interaction with different science. You can find out a lot more about what we do on our website and that science today is computer science. So this is the annual Yip Lecture. We're very grateful to Dr. Yip for the funding for this lecture. And we're very pleased to have Scott Aaronson. Scott is an expert on computational complexity, quantum computation, AI alignment, many, many topics. And he's a professor at the University of Texas at Austin. And today, he'll tell us how much math is knowable. - Okay, yeah, can you hear? Yep, all right, good. So, thank you so much to Dan, who was my former colleague at UT Austin, but you know, Harvard is good too. It would be an honor, obviously, like on any week, to deliver the Yip Lecture at Harvard, okay? But it's particularly an honor to speak at Harvard this week. You know, I mean, I think the rest of us in American academia are looking to Harvard right now to defend the value of (audience applauding) their enterprise. So, you know, fight fiercely, Harvard. But, you know, the truth is that like the more depressing, you know, the news is, and the more is happening, like the more my own thoughts turn
On Hacker News
An interesting thing about this is that they figured out a high-level description of what this Busy Beaver program is doing - it's computing a Collatz-like sequence until it terminates. I'm not sure if that is described in this paper, but I learned about it in this Scott Aaronson talk, [VIDEO] e.g see the slide at 31:40. — ks2048, 2025-09
Scott Aaronson | How Much Math Is Knowable? [Harward CMSA]: [VIDEO] Recently on HN (couple of months ago): [LINK] — vismit2000, 2025-06
Feature Request: Can we have dark mode for videos? An AI OS should be able to understand and satisfy such a usecases. E.g. Scott Aaronson | How Much Math Is Knowable? [VIDEO] The video slides could be converted into a dark mode for night viewing. — nthingtohide, 2025-04
Related videos
- Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich · Confreaks · 53:21
- Brian Beckman: Don't fear the Monad · jasonofthel33t · 1:07:10
- 28c3: The Science of Insecurity · 28c3 · 59:23
- "Propositions as Types" by Philip Wadler · Strange Loop Conference · 42:43
- Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas · Adrian Crenshaw · 46:19
- Math's Fundamental Flaw · Veritasium · 33:59
- The Banach–Tarski Paradox · Vsauce · 24:13
- On The Turing Completeness of PowerPoint (SIGBOVIK) · Tom Wildenhain · 5:33
- The Future of Mathematics? · Microsoft Research · 1:14:48
- Life in life · Phillip Bradbury · 1:30
- Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript · Fullstack Academy · 1:02:15
- All the Numbers - Numberphile · Numberphile · 14:26
- P vs. NP and the Computational Complexity Zoo · hackerdashery · 10:44
- Leslie Lamport: Thinking Above the Code · Microsoft Research · 59:50
- How To Count Past Infinity · Vsauce · 23:46
- Ruby Manor 3 - Programming with Nothing by Tom Stuart · Confreaks · 40:49