lambda calculus

2swap explores lambda calculus using John Tromp's lambda diagrams, with animated beta-reductions, asking what PLUS times PLUS gives. It touches on Church encodings and the equivalence of Turing machines and lambda calculus.

Veritasium's explainer on Godel's incompleteness theorems and the limits of mathematical proof, tracing set theory, Hilbert's program and the road to Turing and modern computing.

Polylog explains how algorithms can be turned into circuits and encoded as satisfiability problems, which lets you effectively run them backwards. It uses this to motivate breaking RSA, general reductions to SAT, and what P vs NP is really asking.