1 HN user recommended this lecture1 month2025score 1
Years with an HN recommendation, 2007–2026
Pointed to in Busy Beaver threads as an accessible expert talk on the topic.
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.
“I learned about it in this Scott Aaronson talk,” (HN, 2025)
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.
Explains the Busy Beaver program's Collatz-like behavior around 31:40.
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.
Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.
Plays via YouTube's privacy-enhanced embed
3 Hacker News comments
From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.
Citations, criticism and jokes