The Hardest Problem in Type Theory - Computerphile @Computerphile

Updated September 2026, 1 week ago

The Hardest Problem in Type Theory - Computerphile

TCP b : Additive Increase Multiplicative Decrease & Slow Start - Computerphile

$Recursive Ray Tracing - Computerphile Ray Tracing seems straightforward, but what about reflections and refractions? Lewis Stuart explains how these are managed by a spot of recursion! Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile This video was filmed and edited by Sean Riley. Computerphile is a sister project to Brady Harans Numberphile. More at https://www.bradyharanblog.com$

Sir Clive Sinclair & British Computer Revolution - Computerphile

How Branch Prediction Works in CPUs - Computerphile

Elliptic Curve Back Door - Computerphile

A Helping Hand for LLMs (Retrieval Augmented Generation) - Computerphile

Defining Cybersecurity with Gene Spafford - Computerphile

Rust and RAII Memory Management - Computerphile

Computerphile |

The Hardest Problem in Type Theory - Computerphile