hackertube.io

Scott Aaronson | How Much Math Is Knowable?

Harvard CMSA · lecture · Watch on YouTube

Computability & complexity theoryLogic & formal methods

What it is

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 recommends it

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

  • 1 people recommended it
  • 1 different months
  • 0 strong recommendations
  • first 2025, last 2025

What HN commenters said

  1. “I learned about it in this Scott Aaronson talk,”

    Explains the Busy Beaver program's Collatz-like behavior around 31:40.

    ks2048, 2025-09 · Recommendation · in “Determination of the fifth Busy Beaver value”

Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.

Topics: busy beaver, scott aaronson, incompleteness, uncomputability, theoretical computer science

Also recommended by the same people