58K views · Apr 22, 2025 · 1:06:43 · 1 HN recommender · 3 mentions · discussed 2025
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 Hacker News points people here: Pointed to in Busy Beaver threads as an accessible expert talk on the topic.
“I learned about it in this Scott Aaronson talk,”HN comment, 2025
“I learned about it in this Scott Aaronson talk,”
Explains the Busy Beaver program's Collatz-like behavior around 31:40.
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.
“The video slides could be converted into a dark mode for night viewing.”
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.
Aaronson talk related to Busy Beaver.
Scott Aaronson | How Much Math Is Knowable? [Harward CMSA]: this video Recently on HN (couple of months ago): link
