Scott Aaronson | How Much Math Is Knowable? on HackerTube: recommended by 1 Hacker News commenter across 1 month, 2025.
lecture · intermediate · evergreen
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.
“I learned about it in this Scott Aaronson talk,”
3 Hacker News comments link this video. Each one links back to its thread.
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, ▶ this video e.g see the slide at 31:40.
in “Determination of the fifth Busy Beaver value” · View on HN
Scott Aaronson | How Much Math Is Knowable? [Harward CMSA]: ▶ this video Recently on HN (couple of months ago): [link]
in “BusyBeaver(6) Is Quite Large” · View on HN
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? ▶ this video The video slides could be converted into a dark mode for night viewing.
in “AI Horseless Carriages” · View on HN