HackerTube / Video
Scott Aaronson | How Much Math Is Knowable?
Harvard CMSA
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.
3 Hacker News mentions · 2025–2025