▶

Scott Aaronson on Mathematical Knowability and Busy Beaver

Harvard CMSA · Lecture · YouTube title: Scott Aaronson | How Much Math Is Knowable?
Why it's here

Pointed to in Busy Beaver threads as an accessible expert talk on the topic.

What it covers

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.