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.

David Beazley's PyCon 2019 tutorial derives the lambda calculus from the ground up in Python, using only single-argument functions. He builds booleans, numerals and more with no other language features.

Tom Stuart's Ruby Manor 3 talk builds FizzBuzz using nothing but Ruby lambdas, working through Church encodings of numbers, booleans and data structures. It is a hands-on introduction to lambda calculus.

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.

An AWS re:Invent 2018 session in which Holly Mesrobian and Marc Brooker explain how AWS Lambda is built, including its sandboxing, isolation and scaling architecture. It covers what happens under the hood when serverless code runs.

Jim Weirich's RubyConf 2012 talk derives the Y combinator step by step, live-coding in Ruby lambdas. It builds up an understanding of functional programming and lambda calculus from first principles.

The first video of 3Blue1Brown's Essence of Calculus series, which builds toward integrals, derivatives, and the fundamental theorem of calculus from a simple geometry question. It aims to make viewers feel they could have invented calculus themselves.

Philip Wadler's Lambda Days talk on propositions as types, the link between logic and computation that underlies theorem provers and programming language design.

Philip Wadler's Strange Loop talk on Propositions as Types, the link between logic and computation (the Curry-Howard correspondence). He traces its history through Church, Godel and Turing and shows how it shaped theorem provers and programming languages.

3Blue1Brown's chapter 4 on deep learning gives a more formal, symbol-based account of backpropagation calculus, connecting the intuition from the previous chapter to the math found in textbooks and code.

Aditya Siram argues that functional programming has much to learn from Smalltalk's interactivity, using Pharo and Squeak to show live, visual, explorable programming environments.

Erik Meijer argues that category theory is the mathematicians' version of interface-based design. He shows that Java 8 lambdas and method references form a Cartesian closed category.

Meredith Patterson and Sergey Bratus argue that networked software stays insecure because protocols and inputs are too complex to recognize safely. They propose using formal language theory and grammars to build secure, verifiable input handling.

Christopher Domas's Derbycon 2015 talk on the M/o/Vfuscator, a compiler that emits only x86 mov instructions, showing mov is Turing complete. It explains how a full machine is built from mov and why the output is a nightmare to reverse engineer.

A short SIGBOVIK 2017 presentation by Tom Wildenhain showing that PowerPoint animations are Turing complete, with a working Turing machine built in slides. The talk is delivered deadpan as a serious research result.

A two-minute video of Conway's Game of Life running inside Conway's Game of Life, built from OTCA metapixels and Golly. It zooms smoothly between scales.

Matt Parker talks Numberphile through the different kinds of numbers: algebraic, transcendental, computable, normal, and beyond. It shows how few numbers we can actually name or describe.

An 11-minute animated introduction to P vs. NP and the wider landscape of complexity classes, inspired by the Complexity Zoo wiki. It assumes no background in computer science.

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.

Matt Might's Curry On talk on ending errors in code, both software and the human genome. He covers conservative approximation of the halting problem via static analysis and a computational approach to precision medicine.

A panel with Tony Hoare, Joe Armstrong and Carl Hewitt, hosted by Francesco Cesarini, on the history and future of concurrency. The three creators of CSP, Erlang and the actor model discuss their differing approaches.

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.

Kyle Hill of Because Science explains and demonstrates, using real cards, how Magic: The Gathering can be used to build a Turing machine, a computer inside the card game.

The first video in a series on extremely large numbers, introducing the topic with examples. Later parts go deep into the fast-growing hierarchy.

A Computerphile video in which Mark Jago of the University of Nottingham explains Turing's halting problem and how it led to the blueprint for the modern computer.

John Conway talks in a short Numberphile interview about his mixed feelings toward the Game of Life, his most famous invention. He says he is not especially pleased that it overshadowed his other work.

Find the Longest Path is a comedic song by Daniel J. Barrett, a Billy Joel parody that describes the NP-hard longest path problem in informal terms.

A short demo of a playable Space Invaders game built inside Dwarf Fortress, with a downloadable map. It shows the game's mechanics used as a computing substrate.

Pro Magic player Luis Scott-Vargas triggers a mandatory-action infinite loop on Magic Online, and the game stalls in a non-terminating state.

An animated, musical visualization of Conway's Game of Life showing patterns made in the Golly program.

Eugenia Cheng gives the opening keynote at Lambda World 2017, presenting category theory as very abstract algebra whose abstraction gives it broad applicability. She applies it to everyday questions including privilege and prejudice.

A short 3Blue1Brown video explaining Euler's formula e^(i*pi) = -1 through dynamics, treating velocity as the thing that moves a point to a new position. It builds geometric intuition for why an exponent with i produces rotation.

3Blue1Brown's third deep learning chapter gives a visual, intuitive account of backpropagation and what happens to a neural network as it learns. A follow-up video covers the underlying 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.

Herb Sutter revisits basic C++ questions in light of C++11 and C++14: how to declare and initialize variables, pass values to functions, write loops, and use smart pointers. It covers auto, rvalue references, range-for, uniform initialization, lambdas, unique_ptr and shared_ptr.