Encoding Recursion as Self-Application

This lecture introduces lambda calculus as a minimal language for expressing recursion, demonstrating how recursion can be encoded using higher-order functions. It explores the concept of first-class functions subsuming recursion and towards a general form of recursive function encoding.