Automated Mathematical Proofs - Computerphile
Could a computer program find Fermat's Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS (A deeper dive into automated proofs) : • EXTRA BITS: Automated Proofs - Computerphile / computerphile / computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com
▶︎
If Prime Numbers Become Increasingly Rare, Then Why Do They Keep Showing Up In Pairs?
▶︎
Machine Code Explained - Computerphile
▶︎
Reinventing Entropy | Compression is Intelligence Part 1
▶︎
Terence Tao: Nobody Understands Why AI Actually Works
▶︎
Reverse Engineering - Computerphile
▶︎
Infinitude of primes --- a Lean theorem prover demo
▶︎
How (and why) to Build an Automated Theorem Prover: De-mystifying Logical Inference
▶︎
The Hardest Problem in Type Theory - Computerphile
▶︎
Why Vlad Tenev and Tudor Achim of Harmonic Think AI Is About to Change Math—and Why It Matters
▶︎
Intro to the Lean Theorem Prover | Jakob von Raumer (Lindy Labs) - DSS 101 2024
▶︎
But what is quantum computing? (Grover's Algorithm)
▶︎
Malware and Machine Learning - Computerphile
▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup
▶︎
Garbage Collection (Mark & Sweep) - Computerphile
▶︎
Terence Tao - Machine-Assisted Proofs (February 19, 2025)
▶︎
Binary Search Algorithm - Computerphile
▶︎
Rust and RAII Memory Management - Computerphile
▶︎
The Best New Programming Language is a Proof Assistant by Harry Goldstein | DC Systems 006
▶︎
Can AI Prove It? Terence Tao on “Big Math” and Our Theoretical Future | The Futurology Podcast
▶︎