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
▶︎
(Not) Discussing the Web @ 30 Years Old - Computerphile
▶︎
Hacking Out of a Network - Computerphile
▶︎
Eliminating Run-Time Errors with Agda - Computerphile
▶︎
"A Little Taste of Dependent Types" by David Christiansen
▶︎
Bit Blit Algorithm (Amiga Blitter Chip) - Computerphile
▶︎
How I became seduced by univalent foundations
▶︎
Trump Gets Booed & Falls Asleep During NBA Finals, Claims War is Almost Over & Goodbye Spencer Pratt
▶︎
Propositions as Types - Computerphile
▶︎
Recreating Dennis Ritchie's PhD Thesis - Computerphile
▶︎
Type theory and the algebra of types
▶︎
Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
▶︎
Why Information Theory is Important - Computerphile
▶︎
Breaking RSA - Computerphile
▶︎
The Most Difficult Program to Compute? - Computerphile
▶︎
Computer Science ∩ Mathematics (Type Theory) - Computerphile
▶︎
START MONDAY WITH FAITH | LORD STRENGTHEN MY HEART FOR WHAT IS TO COME | FATHER FREDDY BUSTAMANTE
▶︎
Exposing The Solid State Donut Battery. It's Over.
▶︎
When Unix Landed - Computerphile
▶︎
Frankreich schmeißt Hegseth raus, wütender Mob in NYC: Trump-Lager hat weltweit "Hausverbot"
▶︎