Skip to content
HomeVideos
AllLongsCategoriesPlaylists
BooksBlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K

    Scott Aaronson | How Much Math Is Knowable?

    Harvard CMSA

    1 HN recommender · recommended in 3 months, 2025

    YouTube

    1:06:43 · 58K views · Apr 22, 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.

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

    Mathematics & Theoretical CSComputability & complexity theoryLogic & formal methods
    1. 34:00
      Math's Fundamental FlawVeritasium31M views • 5 years ago
    2. 10:44
      P vs. NP and the Computational Complexity Zoohackerdashery3.7M views • 12 years ago
    3. 42:43
      "Propositions as Types" by Philip WadlerStrange Loop Conference144K views • 11 years ago
    4. 1:14:48
      The Future of Mathematics?Microsoft Research116K views • 7 years ago
    5. 6:14
      Turing & The Halting Problem - ComputerphileComputerphile919K views • 12 years ago
    6. 1:00:34
      1. Introduction, Finite Automata, Regular ExpressionsMIT OpenCourseWare628K views • 5 years ago
    7. 51:32
      Great Impractical Ideas in Computer Science: PowerPoint ProgrammingTom Wildenhain2.2M views • 7 years ago
    8. 59:23
      28c3: The Science of Insecurity28c342K views • 14 years ago
    9. 1:02:15
      Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScriptFullstack Academy228K views • 9 years ago
    10. 1:02:34
      MIT Godel Escher Bach Lecture 1jasonofthel33t557K views • 13 years ago
    11. 5:34
      On The Turing Completeness of PowerPoint (SIGBOVIK)Tom Wildenhain1.2M views • 9 years ago
    12. 7:42
      Extremely Large Numbers 1 - IntroductionGiroux Studios20K views • 11 years ago
    13. 3:26:34
      David Beazley - Lambda Calculus from the Ground Up - PyCon 2019PyCon 201952K views • 7 years ago
    14. 1:07:22
      Invited Talk - Guy SteeleClojureTV39K views • 9 years ago
    15. 53:22
      Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim WeirichConfreaks66K views • 13 years ago
    16. 1:01:39
      "Simple Made Easy" - Rich Hickey (2011)Strange Loop Conference220K views • 5 years ago
    17. 10:00
      SICP / What is "Computer Science" ?LarryNorman131K views • 20 years ago
    18. 3:38:43
      Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234Lex Fridman4.8M views • 5 years ago
    19. 14:27
      All the Numbers - NumberphileNumberphile1.8M views • 7 years ago
    20. 17:58
      What P vs NP is actually aboutPolylog257K views • 2 years ago

    3 comments from Hacker News

    1. @ks2048Sep 2025· in “Determination of the fifth Busy Beaver value”

      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.

      RecommendsView on HN
    2. @nthingtohideApr 2025· in “AI Horseless Carriages”

      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.

      CitesView on HN
    3. @vismit2000Jun 2025· in “BusyBeaver(6) Is Quite Large”

      Scott Aaronson | How Much Math Is Knowable? [Harward CMSA]: this video Recently on HN (couple of months ago): [LINK]

      CitesView on HN