Scott Aaronson | How Much Math Is Knowable?
Harvard CMSA1 HN recommenders · 2025–2025
58K views · lecture · evergreen · Uploaded 2025-04-22
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.
Pointed to in Busy Beaver threads as an accessible expert talk on the topic.
53:22Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
Confreaks
1:07:10Brian Beckman: Don't fear the Monad
jasonofthel33t
59:2328c3: The Science of Insecurity
28c3
42:43"Propositions as Types" by Philip Wadler
Strange Loop Conference
46:19Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
Adrian Crenshaw
34:00Math's Fundamental Flaw
Veritasium
24:14The Banach–Tarski Paradox
Vsauce
5:34On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
3 comments from Hacker News
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.
Scott Aaronson | How Much Math Is Knowable? [Harward CMSA]: [VIDEO] Recently on HN (couple of months ago): [LINK]
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.