lecture · HACKER NEWS RECOMMENDATION
Scott Aaronson | How Much Math Is Knowable?
Harvard CMSA · 1 HN recommenders · 1 recommendation months
Recommended by 1 Hacker News commenters across 1 months (2025–2025).
SignalTube analysis
Among 5 other lecture videos tagged Computability & complexity theory, the mean is 3.4 distinct HN recommenders. This video has 1 distinct HN recommenders, below that mean. Recommendations span 1 distinct month; the peer average is 3.2 months. This is a data-derived comparison, not a human review or quality rating.
33% of its 3 labeled comments are marked as recommendations or strong recommendations. HN mention years are 2025–2025; those years describe discussion history, not upload date. Its verified runtime is 66 minutes 43 seconds. YouTube lists its publication date as 2025-04-22.
- Channel / speaker
- Harvard CMSA
- Verified runtime
- 1h 6m 43s
- YouTube upload date
- 2025-04-22
- Hacker News mention years
- 2025–2025
SAME TOPIC AND FORMAT
Compare with related videos
The comparison cohort uses other lecture videos in Computability & complexity theory. “Shared recommenders” counts HN users who recommended both videos in the source graph.
| Video | HN recommenders | Recommendation months | Positive label share | Shared recommenders | Runtime | Upload date |
|---|---|---|---|---|---|---|
| Scott Aaronson | How Much Math Is Knowable?Current video | 1 | 1 | 33% | — | 1h 6m 43s | 2025-04-22 |
| Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScriptlecture · Fullstack Academy | 5 | 5 | 100% | No recorded overlap | 62m 15s | 2017-08-25 |
| Great Impractical Ideas in Computer Science: PowerPoint Programminglecture · Tom Wildenhain | 4 | 4 | 80% | No recorded overlap | 51m 32s | 2019-10-29 |
| 1. Introduction, Finite Automata, Regular Expressionslecture · MIT OpenCourseWare | 4 | 3 | 80% | No recorded overlap | 60m 34s | 2021-10-06 |
THREE SOURCE-BASED CONTEXT POINTS
Why Hacker News recommends it
Each note combines the dataset’s stance label and short rationale; comment bodies are not reproduced. Open the HN source for the original discussion.
The archive classifies this as a recommendation in “Determination of the fifth Busy Beaver value”. Its short rationale: Explains the Busy Beaver program's Collatz-like behavior around 31:40.
The archive classifies this as a contextual reference in “BusyBeaver(6) Is Quite Large”. Its short rationale: Aaronson talk related to Busy Beaver.
The archive classifies this as a contextual reference in “AI Horseless Carriages”. Its short rationale: the source snapshot has no short rationale for this mention.