Scott Aaronson | How Much Math Is Knowable?

Why it was recommended

I learned about it in this Scott Aaronson talk,

Recommendationks2048 · Original2025-09

What it covers

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. It is for someone who already knows the basic terms and wants the next step.

Video details

Channel

Harvard CMSA

Length

1 hr 6 min

Year

2025

More in this topic

• Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
• 28c3: The Science of Insecurity
• "Propositions as Types" by Philip Wadler
• Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
• Math's Fundamental Flaw
• On The Turing Completeness of PowerPoint (SIGBOVIK)