The Hardest Problem in Type Theory - Computerphile
129.5 هزار بار بازدید -
3 سال پیش
-
Equality sounds a straightforward idea,
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
Facebook: computerphile
Twitter: 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
More of Thorsten on Type Theory: https://bit.ly/C_Thor_playlist
Thorsten's paper dedicated to Martin: https://bit.ly/C_Thor_Paper
Facebook: computerphile
Twitter: 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
3 سال پیش
در تاریخ 1400/05/08 منتشر شده
است.
129,562
بـار بازدید شده