evolutionary computation

Lex Fridman interviews Stephen Wolfram for about three hours on cellular automata, computation, the Wolfram Physics Project and his career with Mathematica and Wolfram Alpha.

Clip from Lex Fridman's podcast with Roger Penrose in which Penrose argues that consciousness is not a computation. He discusses Godel-style arguments and the possible role of quantum effects in microtubules.

A roughly four-and-a-half-hour Lex Fridman podcast conversation with Stephen Wolfram about his Wolfram Physics Project and a fundamental theory of physics, computation, life and the universe.

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.

Chuck Spinney, a long-time associate of John Boyd, presents Boyd's thinking on the OODA loop and evolutionary epistemology. The talk runs about two and a half hours and includes Q&A.

A long Portal podcast episode in which Bret Weinstein tells Eric Weinstein the story of his lab mice telomere work, the prediction behind it, and what it means for science and aging.

Tech Ingredients shows how to make a homemade radiative cooling paint, with a custom liquid panel that cools below ambient temperature outdoors. The video covers the materials and how to apply the paint.

A long Lex Fridman interview with Stephen Wolfram on complexity, cellular automata, computational irreducibility and the Wolfram Physics Project.

Veritasium explores the Prisoner's Dilemma and Axelrod's tournaments, showing why tit-for-tat and forgiving strategies win in repeated games. It extends the ideas to cooperation in evolution and conflict.

Gerald Sussman's 2011 Strange Loop keynote argues we still do not know how to compute, comparing biological systems with how we program machines. It touches on propagators, constraint programming and robustness.

Lex Fridman has a three-hour conversation with Joscha Bach about artificial consciousness, the workings of the mind, intelligence and the possibly simulated nature of reality.

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.

Lex Fridman interviews physicist Roger Penrose on consciousness, the limits of computation, quantum mechanics and his cyclic cosmology. It covers his views on AI and the big bang.

AlphaPhoenix uses Monte Carlo simulation and annealing-style methods to draw North Carolina congressional district maps, both gerrymandered and fair. He focuses on the fascinating computational problem rather than the politics.

Peter Shor tells the story of how he discovered Shor's Algorithm, from his early mathematics days to the quantum factoring breakthrough. It was recorded at MIT at the Physics of Computation conference.

Kaze Emanuar searches for the best sine approximation for the Nintendo 64, comparing the lookup tables in Mario 64 and Ocarina of Time with polynomial alternatives. It walks through numerics and 3rd, 4th and 5th order approximations.

Jim Keller's talk at the 2020 Scaled Machine Learning conference on Moore's Law in the age of AI chips. He compares scalar, vector and GPU-style parallel approaches to computation.

A five-minute demo of the Common Lisp debugger fixing a bug, recompiling a single function, and resuming execution from the failed stack frame. It shows how to avoid re-running long computations.

Machine Learning Street Talk interviews Paul Lessard about Categorical Deep Learning, which uses category theory and monads to make neural network architectures more interpretable and composable. They also discuss neural networks' limits in reasoning and unbounded computation.