Channel: Computerphile

Category: Education

Tags: type theoryuniversity of nottinghammartin hofmanncomputertheoretical computer sciencecomputerphilecomputer scienceformal computer sciencesciencemathematical proofthorsten altenkirchproofcomputers

Description: 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: bit.ly/C_Thor_playlist Thorsten's paper dedicated to Martin: bit.ly/C_Thor_Paper facebook.com/computerphile twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: bit.ly/nottscomputer Computerphile is a sister project to Brady Haran's Numberphile. More at bradyharan.com