HackerTube

The Future of Mathematics?

Microsoft Research9 HN recommenders · recommended in 7 months, 2019–2025
YouTube
talk · general · evergreen · 2019–2025 on HN

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.

12 comments from Hacker News

@ookdatnog2025-08 · 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

Recommends View on HN
@pas2023-10 · in “Lean4 helped Terence Tao discover a small bug in his recent paper”

Kevin Buzzard (a professional mathematician) has a few good talks about Lean ▶ this video from 2019 at MS Research link (2022 at ICM international math congress)

Recommends View on HN
@liups2021-12 · 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"

Recommends View on HN
@oolonthegreat2021-07 · in “Some stuff I found interesting about number theory research”

wanted to drop a link to buzzard's very interesting talk ▶ this video starting at 13:00 he talks about that frailness. also loved the bit about "elders" at 40:37

Recommends View on HN
@andrewnc2021-05 · 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

Recommends View on HN