The Hardest Problem in Type Theory - Computerphile
Equality sounds a straightforward idea, but there are subtle problems in theoretical computer science. Professor Thorsten Altenkirch explains how his late friend Martin Hofmann solved one of the biggest problems. More of Thorsten on Type Theory: https://bit.ly/C_Thor_playlist Thorsten's paper dedicated to Martin: https://bit.ly/C_Thor_Paper / 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
▶︎
Propositions as Types - Computerphile
▶︎
Shor's Algorithm for Quantum Computing - Computerphile
▶︎
Bit Blit Algorithm (Amiga Blitter Chip) - Computerphile
▶︎
The Greatest Unsolved Problem In Mathematics
▶︎
Nobody Explained Maxwell's Equations Like THIS!
▶︎
Hacking Out of a Network - Computerphile
▶︎
How Branch Prediction Works in CPUs - Computerphile
▶︎
Computer Science ∩ Mathematics (Type Theory) - Computerphile
▶︎
TypeScript in Express – TypeScript Tutorial
▶︎
The PROBLEM with Capitalism - Smarter Every Day 316
▶︎
Why Nigel Farage is Self-Destructing
▶︎
Lawrence Wilkerson: Iran-Krieg spitzt sich zur globalen Krise zu
▶︎
Why Information Theory is Important - Computerphile
▶︎
Quantum Mechanics Explained FROM SCRATCH
▶︎
But what are Hamming codes? The origin of error correction
▶︎
Essentials: Pointer Power! - Computerphile
▶︎
Why does every mammal get 1 billion heartbeats in their life?
▶︎
Homotopy Type Theory Discussed - Computerphile
▶︎
How Small Can a Video Game Actually Be?
▶︎