lambda calculus

Gabriel Lebec's Fullstack Academy talk introduces lambda calculus syntax, the history of mathematical logic, and the essence of functional programming using JavaScript. It also covers combinators, currying and Church encodings.

The preface to Herb Gross's MIT OpenCourseWare 'Calculus Revisited: Single Variable Calculus', an older black-and-white lecture series. It introduces his approach to teaching calculus from the basics.

Tom Wildenhain's guest lecture for CMU's Esoteric Programming Languages course shows that PowerPoint transitions and slides are Turing complete without macros, building up to a mind-bending fractal ending.

The first lecture of Michael Sipser's MIT 18.404J Theory of Computation course, covering course mechanics, finite automata, regular languages and regular expressions. It proves closure of regular languages under union and begins concatenation.

The first lecture of an MIT course on Douglas Hofstadter's Godel, Escher, Bach, covering themes like self-reference, recursion and incompleteness. The full lecture series is on YouTube.

Scott Aaronson's Harvard CMSA talk traces what mathematical truths are knowable, from Godel and Turing to the Busy Beaver function. He covers recent work on Busy Beaver values.

An excerpt from Hal Abelson's opening SICP lecture introducing computer science and contrasting declarative and imperative knowledge. He argues that computer science is not really a science and is more like magic or engineering of ideas.

Andrej Karpathy's first Neural Networks: Zero to Hero lecture, which builds micrograd, a tiny autograd engine, from scratch in Python. It explains backpropagation and neural network training step by step, assuming only basic Python and some high-school calculus.

Leonard Susskind opens Stanford Continuing Studies' Theoretical Minimum series with an introduction to quantum mechanics, a course for people who want real physics rather than popularization. It assumes some calculus and linear algebra.