Uploaded October 2026 | Updated November 2026, 1 day ago
Tsung-Hsien (Shawn) Wen, CTO of PolyAI, tells Tim Scarfe why voice agents are harder than text agents. Voice adds time, and a good conversation depends on adapting to the person on the line, not just on reasoning to the best answer. Shawn describes an audio-native model (Dialog-RSN-1) that first predicts a turn-taking signal, then replies in text with citations, and writes the transcript last so enterprises can audit it.
Along the way: training on real, noisy calls with synthetic noise added, and why over-cleaned audio made the new model worse. Latency, and what a voice agent should do while it thinks. Why a voice with a hint of regional accent beats a generic one. Why public benchmarks fall short for voice, why enterprises want to own their agent harness, and whether behaviour belongs in the harness or in the weights.
The last stretch is about working with agents: cognitive debt, the shift from producing content to checking it, Wispr Flow, building tools that agents can use, and whether slop is in the eye of the reader.
This episode was produced in partnership with PolyAI.
poly.ai
CHAPTERS
0:00 Why voice agents are harder than text
4:27 What enterprises want, and why PolyAI built its own model
9:04 How an audio-native voice model works
15:21 Training data, spectrograms and synthetic noise
20:36 The cocktail party problem and the future of turn-taking
25:21 Latency, adaptive reasoning and keeping callers' trust
31:33 Voices, personality and the uncanny valley
36:32 How do you benchmark a voice agent?
42:00 Harness engineering and owning the intelligence
45:09 Well-specified problems and auditable agents
49:46 Weight adaptation and cognitive debt
56:31 Agents at work: Wispr Flow, voice and tool building
1:02:50 The next decade of voice, and what counts as slop
REFERENCES
The Bitter Lesson: incompleteideas.net/IncIdeas/BitterLesson.html [9:05]
Retrieval-augmented generation: arxiv.org/abs/2005.11401 [13:23]
Mel scale: en.wikipedia.org/wiki/Mel_scale [17:16]
Victor Zue: en.wikipedia.org/wiki/Victor_Zue [17:45]
Cocktail party effect: en.wikipedia.org/wiki/Cocktail_party_effect [20:39]
Speaker diarisation: en.wikipedia.org/wiki/Speaker_diarisation [21:16]
Tsung-Hsien (Shawn) Wen, CTO of PolyAI, tells Tim Scarfe why voice agents are harder than text agents. Voice adds time, and a good conversation depends on adapting to the person on the line, not just on reasoning to the best answer. Shawn describes an audio-native model (Dialog-RSN-1) that first predicts a turn-taking signal, then replies in text with citations, and writes the transcript last so enterprises can audit it.
Along the way: training on real, noisy calls with synthetic noise added, and why over-cleaned audio made the new model worse. Latency, and what a voice agent should do while it thinks. Why a voice with a hint of regional accent beats a generic one. Why public benchmarks fall short for voice, why enterprises want to own their agent harness, and whether behaviour belongs in the harness or in the weights.
The last stretch is about working with agents: cognitive debt, the shift from producing content to checking it, Wispr Flow, building tools that agents can use, and whether slop is in the eye of the reader.
This episode was produced in partnership with PolyAI.
poly.ai
CHAPTERS
0:00 Why voice agents are harder than text
4:27 What enterprises want, and why PolyAI built its own model
9:04 How an audio-native voice model works
15:21 Training data, spectrograms and synthetic noise
20:36 The cocktail party problem and the future of turn-taking
25:21 Latency, adaptive reasoning and keeping callers' trust
31:33 Voices, personality and the uncanny valley
36:32 How do you benchmark a voice agent?
42:00 Harness engineering and owning the intelligence
45:09 Well-specified problems and auditable agents
49:46 Weight adaptation and cognitive debt
56:31 Agents at work: Wispr Flow, voice and tool building
1:02:50 The next decade of voice, and what counts as slop
REFERENCES
The Bitter Lesson: incompleteideas.net/IncIdeas/BitterLesson.html [9:05]
Retrieval-augmented generation: arxiv.org/abs/2005.11401 [13:23]
Mel scale: en.wikipedia.org/wiki/Mel_scale [17:16]
Victor Zue: en.wikipedia.org/wiki/Victor_Zue [17:45]
Cocktail party effect: en.wikipedia.org/wiki/Cocktail_party_effect [20:39]
Speaker diarisation: en.wikipedia.org/wiki/Speaker_diarisation [21:16]

![This is what happens when you let AIs debate
Akbir Khan, AI researcher and ICML 2024 Best Paper winner, joins Tim Scarfe to discuss his groundbreaking work on using debate between language models to improve AI truthfulness and oversight. Khan explains how pitting two LLMs against each other in structured arguments helps non-expert judges arrive at more accurate answers than simply querying a single model — a result with profound implications for supervising AI systems that may eventually surpass human capabilities.
The conversation moves through the mechanics of scalable oversight and the sandwiching protocol that operationalises the problem of checking entities smarter than their supervisors. Khan describes how debate naturally surfaces the cruxes of disagreements, making complex expert judgments more accessible to laypeople. The discussion broadens into the relationship between intelligence and agency, the risks of deceptive alignment and reward tampering, and whether the current trajectory of AI development constitutes the early stages of a Cambrian explosion in artificial minds.
Khan and Scarfe also explore open-ended AI systems, Kenneth Stanleys arguments against objective-driven optimization, and the philosophical terrain mapped by thinkers like Aaron Sloman and Francois Chollet on the space of possible minds and measuring intelligence. The episode closes with a frank exchange on cultural evolution, memetics, and whether the intelligence that matters most for AI safety is the kind we can measure.
REFERENCES:
person:
[00:00:00] Akbir Khan
https://akbir.dev/
other:
[00:00:00] MLST Episode Shownotes PDF
https://www.dropbox.com/scl/fi/sjekivbg3ok6qugsv2p1u/AkbirKhan.pdf?rlkey=ewiyvq0aq7mjvql4u7os0jos2&st=vblhp7af&dl=0
[00:06:05] OpenAI Superalignment Team
https://openai.com/index/introducing-superalignment/
[00:19:10] DeepMind Responsible AI
https://deepmind.google/about/responsibility-safety/
paper:
[00:00:40] Akbir Khan et al. - Debating with More Persuasive LLMs
https://arxiv.org/html/2402.06782v3
[00:08:10] Sam Bowman - Scalable Oversight in AI Systems
https://arxiv.org/abs/2211.03540
[00:10:35] Sam Bowman - Artificial Sandwiching Protocol
https://www.alignmentforum.org/posts/nekLYqbCEBDEfbLzF/artificial-sandwiching-when-can-we-test-scalable-alignment
[00:14:35] Janus - Simulators
https://www.lesswrong.com/posts/vJFdjigzmcXMhNTsx/simulators
[00:21:30] Eliezer Yudkowsky - AI FOOM Debate
https://intelligence.org/files/AIFoomDebate.pdf
[00:21:45] Sammy Martin - Discontinuous AI Progress
https://www.alignmentforum.org/posts/5WECpYABCT62TJrhY/will-ai-undergo-discontinuous-progress
[00:24:35] Nora Belrose - Counting Arguments vs AI Doom
https://www.lesswrong.com/posts/YsFZF3K9tuzbfrLxo/counting-arguments-provide-no-evidence-for-ai-doom
[00:25:35] Evan Hubinger - Deceptive Alignment
https://www.lesswrong.com/posts/zthDPAjh9w6Ytbeks/deceptive-alignment
[00:26:50] Anthropic - Reward Tampering
https://www.anthropic.com/research/reward-tampering
[00:34:58] Ryan Greenblatt et al. - AI Control
https://arxiv.org/pdf/2312.06942
[00:37:20] Aaron Sloman - The Space of Possible Minds
https://www.cs.bham.ac.uk/research/projects/cogaff/sloman-space-of-minds-84.pdf
[00:38:45] Francois Chollet - On the Measure of Intelligence
https://arxiv.org/abs/1911.01547
[00:42:45] Jonathan Cook et al. - Artificial Generational Intelligence
https://arxiv.org/abs/2406.00392
video:
[00:03:28] Yann LeCun on Machine Learning Debates
https://www.youtube.com/watch?v=OKkEdTchsiE
book:
[00:16:35] Thomas Suddendorf - The Gap
https://www.amazon.in/GAP-Science-Separates-Other-Animals/dp/0465030149
[00:32:35] Kenneth Stanley - Why Greatness Cannot Be Planned
https://www.amazon.co.uk/Why-Greatness-Cannot-Planned-Objective/dp/3319155237
[00:42:30] Richard Dawkins - The Selfish Gene
https://www.amazon.co.uk/Selfish-Gene-Richard-Dawkins/dp/0192860925
LINKS:
Full Transcript: https://app.rescript.info/share/c75b45c237ad52154d276851af8f812b
Download PDF transcript: https://app.rescript.info/api/public/sessions/571abed49dab3e7f/pdf
Akbir Khan:
https://x.com/akbirkhan
https://akbir.dev/ This is what happens when you let AIs debate](https://i.ytimg.com/vi/WlWAhjPfROU/mqdefault.jpg)


![What is “reasoning” in modern AI?
Professor Swarat Chaudhuri from the University of Texas at Austin and visiting researcher at Google DeepMind discusses breakthroughs in AI reasoning, theorem proving, and mathematical discovery. Chaudhuri explains his groundbreaking work on COPRA (a GPT-based prover agent), shares insights on neurosymbolic approaches to AI.
Professor Swarat Chaudhuri:
https://www.cs.utexas.edu/~swarat/
SPONSOR MESSAGES:
CentML offers competitive pricing for GenAI model deployment, with flexible options to suit a wide range of models, from small to large-scale deployments.
https://centml.ai/pricing/
Tufa AI Labs is a brand new research lab in Zurich started by Benjamin Crouzier focussed on ARC and AGI, they just acquired MindsAI - the current winners of the ARC challenge. Are you interested in working on ARC, or getting involved in their events? Goto https://tufalabs.ai/
TOC:
[00:00:00] 0. Introduction / CentML ad, Tufa ad
1. AI Reasoning: From Language Models to Neurosymbolic Approaches
[00:02:27] 1.1 Defining Reasoning in AI
[00:09:51] 1.2 Limitations of Current Language Models
[00:17:22] 1.3 Neuro-symbolic Approaches and Program Synthesis
[00:24:59] 1.4 COPRA and In-Context Learning for Theorem Proving
[00:34:39] 1.5 Symbolic Regression and LLM-Guided Abstraction
2. AI in Mathematics: Theorem Proving and Concept Discovery
[00:43:37] 2.1 AI-Assisted Theorem Proving and Proof Verification
[01:01:37] 2.2 Symbolic Regression and Concept Discovery in Mathematics
[01:11:57] 2.3 Scaling and Modularizing Mathematical Proofs
[01:21:53] 2.4 COPRA: In-Context Learning for Formal Theorem-Proving
[01:28:22] 2.5 AI-driven theorem proving and mathematical discovery
3. Formal Methods and Challenges in AI Mathematics
[01:30:42] 3.1 Formal proofs, empirical predicates, and uncertainty in AI mathematics
[01:34:01] 3.2 Characteristics of good theoretical computer science research
[01:39:16] 3.3 LLMs in theorem generation and proving
[01:42:21] 3.4 Addressing contamination and concept learning in AI systems
REFS:
00:04:58 The Chinese Room Argument, https://plato.stanford.edu/entries/chinese-room/
00:11:42 Software 2.0, https://medium.com/@karpathy/software-2-0-a64152b37c35
00:11:57 Solving Olympiad Geometry Without Human Demonstrations, https://www.nature.com/articles/s41586-023-06747-5
00:13:26 Lean, https://lean-lang.org/
00:15:43 A General Reinforcement Learning Algorithm That Masters Chess, Shogi, and Go Through Self-Play, https://www.science.org/doi/10.1126/science.aar6404
00:19:24 DreamCoder: Bootstrapping Inductive Program Synthesis with Wake-Sleep Library Learning (Ellis et al., PLDI 2021), https://arxiv.org/abs/2006.08381
00:24:37 The Lambda Calculus, https://plato.stanford.edu/entries/lambda-calculus/
00:26:43 Neural Sketch Learning for Conditional Program Generation, https://arxiv.org/pdf/1703.05698
00:28:08 Learning Differentiable Programs With Admissible Neural Heuristics, https://arxiv.org/abs/2007.12101
00:31:03 Symbolic Regression With a Learned Concept Library (Grayeli et al., NeurIPS 2024), https://arxiv.org/abs/2409.09359
00:41:21 Turing Machines, https://plato.stanford.edu/entries/turing-machine/#HaltProb
00:41:30 Formal Verification of Parallel Programs, https://dl.acm.org/doi/10.1145/360248.360251
01:00:08 The Feynman Lectures, https://www.feynmanlectures.caltech.edu/
01:00:37 Training Compute-Optimal Large Language Models, https://arxiv.org/abs/2203.15556
01:12:26 Fermats Last Theorem, https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem
01:18:19 Chain-of-Thought Prompting Elicits Reasoning in Large Language Models, https://arxiv.org/abs/2201.11903
01:18:42 Draft, Sketch, and Prove: Guiding Formal Theorem Provers With Informal Proofs, https://arxiv.org/abs/2210.12283
01:19:49 Learning Formal Mathematics From Intrinsic Motivation, https://arxiv.org/pdf/2407.00695
01:20:19 An In-Context Learning Agent for Formal Theorem-Proving (Thakur et al., CoLM 2024), https://arxiv.org/pdf/2310.04353
01:23:58 Learning to Prove Theorems via Interacting With Proof Assistants, https://arxiv.org/abs/1905.09381
01:35:50 Algorithmic Game Theory, https://www.amazon.ca/Algorithmic-Game-Theory-Noam-Nisan/dp/0521872820
01:39:58 An In-Context Learning Agent for Formal Theorem-Proving (Thakur et al., CoLM 2024), https://arxiv.org/pdf/2310.04353
01:42:24 Programmatically Interpretable Reinforcement Learning (Verma et al., ICML 2018), https://arxiv.org/abs/1804.02477 What is “reasoning” in modern AI?](https://i.ytimg.com/vi/XFMk0snybAc/mqdefault.jpg)

![NEURAL NETWORKS ARE WEIRD! - Neel Nanda (DeepMind)
SPONSOR MESSAGES:
***
CentML offers competitive pricing for GenAI model deployment, with flexible options to suit a wide range of models, from small to large-scale deployments.
https://centml.ai/pricing/
Neel Nanda leads the mechanistic interpretability team at Google DeepMind. At 26, hes become one of the most prominent researchers working on the question of whats actually going on inside neural networks systems that can win IMO medals and write complex software, but which nobody actually designed or understands.
This nearly four-hour conversation is a deep technical dive into the field. Nanda explains why machine learning is fundamentally weird: we produce artifacts that do impressive things, but unlike conventional software, no one wrote the code or planned the architecture. His teams goal is reverse-engineering these systems by finding the internal structures and algorithms that emerge during training.
The discussion covers the mechanics of sparse autoencoders at length how they decompose model activations into interpretable feature vectors, the mathematical foundations (ReLU vs TopK activation functions), scaling laws for feature learning, and the engineering challenges of running them at the scale of frontier models. Nanda walks through the Golden Gate Claude experiment (amplifying a single feature to make Claude obsessed with the Golden Gate Bridge), induction heads (the circuits responsible for in-context learning), and activation patching as a causal intervention technique.
On AI safety, Nanda is pragmatic. He argues that mechanistic interpretability gives us genuine empirical evidence about questions that are otherwise stuck in philosophical debate do models have goals? Do they deceive? He also discusses the limitations: sparse autoencoders havent yet demonstrated capabilities beyond what fine-tuning already achieves, and at sufficient model complexity, models could potentially facade interpretability measurements. The conversation covers his path from pure maths at Cambridge through Anthropic to DeepMind, and why he thinks hands-on coding matters more than reading papers for new researchers entering the field.
REFERENCES:
person:
[00:00:00] Neel Nanda - Personal Website
https://www.neelnanda.io/
tool:
[00:35:00] TransformerLens
https://github.com/TransformerLensOrg/TransformerLens
paper:
[01:00:31] A Mathematical Framework for Transformer Circuits
https://transformer-circuits.pub/2021/framework/index.html
[01:01:40] In-context Learning and Induction Heads
https://transformer-circuits.pub/2022/in-context-learning-and-induction-heads/index.html
[01:21:06] Scaling Monosemanticity
https://transformer-circuits.pub/2024/scaling-monosemanticity/
[01:33:27] Refusal in Language Models Is Mediated by a Single Direction
https://arxiv.org/abs/2406.11717
LINKS:
Full Transcript: https://app.rescript.info/share/acb415fa59ae2d2909d60d761c8f4ff4
Download PDF transcript: https://app.rescript.info/api/public/sessions/c3a4bf1e32a46ce7/pdf
NEEL NANDA:
https://www.neelnanda.io/
https://scholar.google.com/citations?user=GLnX3MkAAAAJ&hl=en
https://x.com/NeelNanda5 NEURAL NETWORKS ARE WEIRD! - Neel Nanda (DeepMind)](https://i.ytimg.com/vi/YpFaPKOeNME/mqdefault.jpg)
![Biologically-inspired AI and Mortal Computation
MLST is sponsored by Tufa Labs:
Are you interested in working on ARC and cutting-edge AI research with the MindsAI team (current ARC winners)?
Focus: ARC, LLMs, test-time-compute, active inference, system2 reasoning, and more.
Future plans: Expanding to complex environments like Warcraft 2 and Starcraft 2.
Interested? Apply for an ML research position: benjamin@tufa.ai
Professor Alexander Ororbia from the Rochester Institute of Technology takes Tim Scarfe through the case for bio-inspired AI. The central idea is mortal computation: you cannot divorce the software from the hardware that runs it. The brain manages remarkable things on a few watts because its computations are entangled with its physical substrate. GPT-class models, running on von Neumann architectures designed for immortal computation where software and hardware are deliberately decoupled pay a staggering energy penalty for that separation.
Ororbia explains the building blocks: Markov blankets as the formalism for system boundaries, Karl Fristons free energy principle as the optimization target, and the MILLS framework (Mortal Inference, Learning, and Selection) operating across multiple timescales. He then surveys the landscape of alternatives to backpropagation predictive coding, Hebbian learning, contrastive methods, and Geoff Hintons forward-forward algorithm showing how each maps to observations from neuroscience.
The conversation gets practical with Ororbias ngc-learn library for implementing these algorithms, the stability-plasticity dilemma in continual learning, and the current state of neuromorphic hardware from Intel Loihi to IBM TrueNorth. He closes with his neural generative coding work, which showed that predictive coding networks can synthesize data they were never trained on outperforming VAEs and GANs and his vision for bio-inspired AI systems that coexist with humanity rather than replacing it.
TIMESTAMPS:
00:00:00 Introduction to Bio-Inspired AI and Mortal Computation
00:04:50 Principles of Mortal Computation
00:17:41 Markov Blankets and Free Energy Principle
00:24:38 MILLS Framework and Biological Systems
00:31:00 Challenging Backpropagation: Alternative Approaches
00:31:49 Predictive Coding and Free Energy Principle
00:41:52 Biologically Plausible Credit Assignment Methods
00:50:11 Taxonomy of Bio-inspired Learning Algorithms
00:59:30 Forward-Only Learning and ngc-learn Implementation
01:03:25 Stability-Plasticity Dilemma and Continual Learning
01:09:00 Neuromorphic Hardware and Challenges
01:12:58 Neural Generative Coding and Future Directions
REFERENCES:
website:
[00:04:43] The Levin Lab
https://drmichaellevin.org/
[00:18:20] Good Regulator Theorem
https://en.wikipedia.org/wiki/Good_regulator
[00:41:52] Hebbian Theory
https://en.wikipedia.org/wiki/Hebbian_theory
[00:45:00] Hopfield Network
https://en.wikipedia.org/wiki/Hopfield_network
[01:09:00] Intel Loihi 2
https://www.intel.com/content/www/us/en/research/neuromorphic-computing-loihi-2-technology-brief.html
paper:
[00:04:50] Mortal Computation: A Foundation for Biomimetic Intelligence
https://arxiv.org/abs/2311.09589
[00:06:53] The Forward-Forward Algorithm
https://arxiv.org/abs/2212.13345
[00:07:20] Theres Plenty of Room Right Here
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10046700/
[00:17:41] The Free-Energy Principle: A Rough Guide to the Brain
https://www.fil.ion.ucl.ac.uk/~karl/The%20free-energy%20principle%20-%20a%20rough%20guide%20to%20the%20brain.pdf
[00:31:49] Predictive Coding in the Visual Cortex
https://www.nature.com/articles/nn0199_79
[00:41:52] Brain-Inspired Machine Intelligence: Neurobiologically-Plausible Credit Assignment
https://arxiv.org/abs/2312.09257
[00:45:50] A Tutorial on Energy-Based Learning
https://yann.lecun.com/exdb/publis/pdf/lecun-06.pdf
[00:46:40] A Learning Algorithm for Boltzmann Machines
https://www.cs.toronto.edu/~hinton/absps/cogscibm.pdf
[00:50:11] A Review of Neuroscience-Inspired Machine Learning
https://arxiv.org/abs/2403.18929
[00:53:20] NEAT: NeuroEvolution of Augmenting Topologies
https://nn.cs.utexas.edu/downloads/papers/stanley.ec02.pdf
[00:56:40] A Path Towards Autonomous Machine Intelligence
https://openreview.net/pdf?id=BZ5a1r-kVsf
[00:59:30] Test-Time Model Adaptation with Only Forward Passes
https://arxiv.org/abs/2404.01650
[01:03:25] Spiking Neural Predictive Coding for Continual Learning
https://www.sciencedirect.com/science/article/pii/S0925231223004150
[01:10:00] IBM TrueNorth
https://research.ibm.com/publications/truenorth-design-and-tool-flow-of-a-65-mw-1-million-neuron-programmable-neurosynaptic-chip
book:
[00:24:38] Active Inference: The Free Energy Principle in Mind, Brain, and Behavior
https://direct.mit.edu/books/oa-monograph/5299/Active-InferenceThe-Free-Energy-Principle-in-Mind
LINKS:
Full Transcript: https://app.rescript.info/share/cfa14d0f39f86d035d5caf6173d6207f
Download PDF transcript: https://app.rescript.info/api/public/sessions/94d5c32d7c507e6a/pdf Biologically-inspired AI and Mortal Computation](https://i.ytimg.com/vi/ZTE-JVd_QkA/mqdefault.jpg)

![The Programming Language That Referees Mathematics — Leo de Moura
Leonardo de Moura created Lean and co-created Z3.
This episode is sponsored by Parallel.
Parallel, where agents find answers: web search, extraction and deep research APIs built for AI agents.
Start free with the Parallel MCP server and $5 of credits every month: https://parallel.ai/mlst?utm_source=creator&utm_medium=podcast&utm_content=MLST
Tim Scarfe talks with Leo about how Lean escaped its original audience, why dependent types and Mathlib made it useful to working mathematicians, and what happens when formal verification leaves the lab. De Moura explains the small trusted kernel and independent checkers, and gives his account of the recent Collatz incident, in which a purported proof was accepted by both Leans official kernel and Nanoda, apparently by exploiting a different bug in each.
The conversation then turns to AI-produced proofs and software. Claude agents rebuild zlib in Lean and the result is verified, yet the example exposes the loophole at the centre of the show: a proof only certifies the specification humans chose to write. De Moura describes proof search as a game, separates formal competence from mathematical understanding, and asks what authorship means when models can generate proofs at scale.
The closing argument puts human responsibility upstream: choosing definitions, judging abstractions, curating Mathlib, inspecting certificates, and deciding which problems deserve effort. He also reflects on Leans future beyond its founder and gives a practical starting point for new users.
TIMESTAMPS:
00:00:00 Cold open: the green checkmark can lie
00:00:59 Cathedral or bazaar: who controls Leans core?
00:04:55 Why Leans core stays small and protected
00:08:07 The Slack purge, Brandolinis law and the Lean FRO
00:11:12 The Collatz exploit: two kernels, two bugs
00:16:44 More kernels, reward hacking and safety by transparency
00:21:04 Sponsor: Parallel
00:21:59 Kim Morrison, Claude and the zlib proof
00:25:25 Can we specify complex systems?
00:28:04 Specs change: proofs are cheaper to redo with AI
00:31:27 From Lean 1 to Lean 4
00:34:57 Dependent types in plain terms
00:37:25 Lean 4s extensibility and Mathlibs growth
00:41:44 Mathlib as infrastructure: Formal Frontiers
00:44:15 Creativity, abstraction and nut-sniping
00:48:46 Breadcrumbs, not learning: what AI agents lack
00:53:03 Competence without comprehension, and verified guardrails
00:56:21 Is the human still the author?
01:01:44 AlphaProof, LLMs and why certificates still matter
01:06:38 Whats next for Lean, and its legacy
01:11:42 How to start learning Lean
REFERENCES:
tool:
[00:00:48] Lean
https://lean-lang.org/
[00:01:24] Mathlib
https://github.com/leanprover-community/mathlib4
[00:12:09] nanoda_lib
https://github.com/ammkrn/nanoda_lib
[00:12:19] CollatzLean
https://github.com/xrchz/CollatzLean/blob/a79357462a33d2a6babd4cf6c8d8bcd25425d653/README.md
[00:13:06] Lean issue 14576
https://github.com/leanprover/lean4/issues/14576
[00:13:21] Lean pull request 14577
https://github.com/leanprover/lean4/pull/14577
[00:13:45] nanoda_lib pull request 22
https://github.com/ammkrn/nanoda_lib/pull/22
[00:15:33] Lean comparator
https://github.com/leanprover/comparator
[00:18:02] Lean4Lean
https://github.com/digama0/lean4lean
[00:19:50] ARC-AGI-3
https://arcprize.org/arc-agi/3
[00:21:59] lean-zip
https://github.com/kim-em/lean-zip
[00:29:45] CompCert
https://compcert.org/
[00:29:45] seL4
https://www.sel4.org/
[00:30:23] Z3
https://github.com/Z3Prover/z3
[00:38:10] Veil
https://github.com/verse-lab/veil
[00:38:10] Velvet
https://github.com/verse-lab/velvet
organization:
[00:00:52] Lean FRO
https://lean-lang.org/fro/
[00:42:39] Mathlib Initiative
https://mathlib-initiative.org/about/
[01:11:42] Computerphile
https://www.youtube.com/@Computerphile
person:
[00:05:11] Ilya Sergey
https://ilyasergey.net/
[00:10:31] Joachim Breitner
https://www.joachim-breitner.de/
[00:32:58] Adam Chlipala
https://adam.chlipala.net/
[00:38:42] Kevin Buzzard
https://www.ma.imperial.ac.uk/~buzzard/
[01:10:16] Terence Tao
https://terrytao.wordpress.com/
book:
[00:08:19] The Proof in the Code
https://us.macmillan.com/books/9780374620059/theproofinthecode/
other:
[00:10:05] Brandolinis law
https://en.wikipedia.org/wiki/Brandolini%27s_law
[00:45:33] A new result on unit distances
https://openai.com/index/model-disproves-discrete-geometry-conjecture/
[01:01:08] Fermats Last Theorem formalisation
https://imperialcollegelondon.github.io/FLT/
paper:
[00:34:36] The Lean 4 theorem prover and programming language
https://doi.org/10.1007/978-3-030-79876-5_37
[01:02:06] AlphaProof
https://doi.org/10.1038/s41586-025-09833-y
[01:04:24] AlphaZero
https://arxiv.org/abs/1712.01815
RESCRIPT:
https://app.rescript.info/share/7d3d4a0059443236a01f6c9acbf4db58
https://app.rescript.info/api/public/sessions/b007264c0ce89047/pdf The Programming Language That Referees Mathematics — Leo de Moura](https://i.ytimg.com/vi/ZpQFebTK75A/mqdefault.jpg)
