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

    The Future of Mathematics?

    Microsoft Research

    9 HN recommenders · recommended in 10 months, 2019–2025

    YouTube

    1:14:48 · 116K views · Oct 1, 2019

    Mathematician Kevin Buzzard explains why he believes the Lean theorem prover will shape the future of mathematics, and describes digitizing his university curriculum in Lean with undergraduates, plus the cultural challenges.

    Recommended as the clearest mathematician's perspective on formal proof assistants and why mathematics should be formalized.

    Mathematics & Theoretical CSLogic & formal methodsPure mathematics
    1. 1:30:45
      The Simple Essence of Automatic Differentiation - Conal ElliottMicrosoft Research17K views • 8 years ago
    2. 42:43
      "Propositions as Types" by Philip WadlerStrange Loop Conference144K views • 11 years ago
    3. 34:00
      Math's Fundamental FlawVeritasium31M views • 5 years ago
    4. 1:07:10
      Brian Beckman: Don't fear the Monadjasonofthel33t415K views • 13 years ago
    5. 1:31:28
      Stanford Seminar: Beyond Floating Point: Next Generation Computer ArithmeticStanford Online33K views • 9 years ago
    6. 17:05
      The essence of calculus3Blue1Brown12M views • 9 years ago
    7. 32:32
      The Strange Math That Predicts (Almost) AnythingVeritasium13M views • 1 year ago
    8. 1:06:43
      Scott Aaronson | How Much Math Is Knowable?Harvard CMSA58K views • 1 year ago
    9. 5:09
      Essence of linear algebra preview3Blue1Brown2.8M views • 10 years ago
    10. 58:30
      What if Current Foundations of Mathematics are Inconsistent? | Vladimir VoevodskyInstitute for Advanced Study57K views • 14 years ago
    11. 44:09
      Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010MIT OpenCourseWare2.8M views • 13 years ago
    12. 1:00:43
      Jim Simons (full length interview) - NumberphileNumberphile21.4M views • 11 years ago
    13. 59:50
      Leslie Lamport: Thinking Above the CodeMicrosoft Research403K views • 12 years ago
    14. 9:52
      Vectors | Chapter 1, Essence of linear algebra3Blue1Brown13M views • 10 years ago
    15. 56:58
      Philip Wadler - Propositions as Types (Lambda Days 2016)Erlang Solutions20K views • 10 years ago
    16. 14:27
      A simple trick to design your own solutions for Rubik's cubesMathologer1.6M views • 10 years ago
    17. 1:01:39
      "Simple Made Easy" - Rich Hickey (2011)Strange Loop Conference220K views • 5 years ago
    18. 1:07:02
      Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)Stanford Online30K views • 8 years ago
    19. 1:12:12
      2017 ACM PPoPP Keynote: It's Time for a New Old LanguageGuy Steele6.8K views • 9 years ago
    20. 30:06
      "Tackling Concurrency Bugs with TLA+" by Hillel WayneStrange Loop Conference24K views • 9 years ago

    14 comments from Hacker News

    1. @liupsDec 2021· in “The year in math and computer science”

      > pure math (topology and countability) and computer science have almost no overlap in the short term. This is an unexpected opinion. What do you mean by this? I would argue the opposite. Look at Formal Verification[0]. Here's a great video about a popular formal verfication proof assitant: this video A quote from the mathematician in the video expressing enthusiasm for using computers for mathematics: "All I want to do... I don't want to do mathematics on pen and paper anymore, because I don't trust it, and I don't trust other people that use it; which is everyone." (in case people only read this quote, instead of watching the lecture, the tone is tongue-in-cheek) Formal Verification would seem a literal intersection of pure math (formal proofs[1]) and computer science (formal specification[2]). Of note, one of the popular underlying foundations of an approach to formal verification is Homotopy Type Theory(HoTT)[3][4] which is an asserted effort to show the relationship between type theory and, specifically, topology (homotopy[5]). [0] [LINK] : fancy word for 'computer verified mathematical proofs' [1] [LINK] : fancy word for 'proof' [2] [LINK] : fancy word for 'rules for an algo that checks a proof' [3] [LINK] [4] [LINK] : a great read, even if you are a novice, or prefer other formal verification foundations [5] [LINK] : "It originated as a topic in algebraic topology"

      RecommendsView on HN
    2. @NzenOct 2019· in “A Code Glitch May Have Caused Errors in More Than a Hundred Published Studies”

      For a perspective of a mathematician that came to evangelize theorem provers, I recommend Kevin Buzzard's MS 2019-09 presentation [0] about LEAN. He highlights cultural misunderstanding and apathy on both sides of the domain divide. He also references the idea that the people who might make the appropriate tools may not have stayed in academia. So, he's structured his courses around using LEAN with the indirect consequence that power users (undergrads) may choose to become open source committers. [0] this video One hour of presentation and then 15 min of q/a. My favorite is around 1:04:00 when someone asks a second time why he disprefers coq, and Buzzard complains that it can't represent some advanced quotient type that he'd have to work around. I'm reminded of [1] [1] [LINK] Dangling by a trivial feature

      RecommendsView on HN
    3. @infogulchOct 2019· in “Alloy is a language for describing structures and a tool for exploring them”

      Last week Microsoft Research posted an interesting talk by Kevin Buzzard [1] from Imperial College London about how he wants to formalize all mathematics with theorem provers. He's currently using LEAN [2]. Half of the talk is a discussion of the challenges he's faced convincing other mathematicians that this is valuable, and the other half is about his success using LEAN as a tool to teach undergraduates about formal proofs in general. I think Alloy was mentioned at the end, but not really compared to LEAN. [1]: this video [2]: [LINK]

      RecommendsView on HN
    4. @andrewncMay 2021· in “Z3 Tutorial”

      That was a delightful tutorial, I recently watched a talk about the Future of Mathematics[0] with respect to theorem proving and formalization. I enjoy this area a lot and love to see it getting more attention. 0 - this video

      RecommendsView on HN
    5. @ookdatnogAug 2025· in “Project to formalise a proof of Fermat’s Last Theorem in the Lean theorem prover”

      I watched this video years ago and found it interesting. It's a talk by Kevin Buzzard, a pure mathematician who got really interested in theorem proving software, and he explains his motivation. this video

      RecommendsView on HN