The Hardest Problem in Type Theory - Computerphile
Video Statistics and Information
Channel: Computerphile
Views: 129,661
Rating: undefined out of 5
Keywords: computers, computerphile, computer, science, Computer Science, Theoretical Computer Science, Thorsten Altenkirch, University of Nottingham, Martin Hofmann, Type Theory, Formal Computer Science, Proof, Mathematical Proof
Id: m_PecfbEWik
Channel Id: undefined
Length: 23min 40sec (1420 seconds)
Published: Fri Jul 30 2021
Please note that this website is currently a work in progress! Lots of interesting data and statistics to come.