HackerTube.runGood videos, with context.
Scott Aaronson | How Much Math Is Knowable?
About this video
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 it appears in the archive
Pointed to in Busy Beaver threads as an accessible expert talk on the topic.
AI-generated summary and labels from the source dataset; verify important details against the video. Source & credits.
From the Hacker News discussion
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.
Read original comment ↗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.
Read original comment ↗Scott Aaronson | How Much Math Is Knowable? [Harward CMSA]: [VIDEO] Recently on HN (couple of months ago): [LINK]
Read original comment ↗