calculus
28:28What is PLUS times PLUS?
2.2M views • 1 year ago
2swap
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.
Topic match · Computability & complexity theory
44:23A Swift Introduction to Geometric Algebra
1.1M views • 6 years ago
sudgylacmoe
An animated introduction to geometric algebra, presented as a language that can describe most of physics. It was made with manim and covers multivectors and how they generalize familiar tools like cross products and quaternions.
Topic match · Pure mathematics
34:00Math's Fundamental Flaw
30.8M views • 5 years ago
Veritasium
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.
Topic match · Computability & complexity theory
18:39This equation will change how you see the world (the logistic map)
17.1M views • 6 years ago
Veritasium
A Veritasium video on the logistic map, showing how a simple population equation leads to chaos and bifurcation. It connects the idea to convection, neuron firing and the Mandelbrot set, with interactive animations.
Topic match · Pure mathematics
23:29How Imaginary Numbers Were Invented
22.7M views • 5 years ago
Veritasium
Veritasium tells the history of how imaginary numbers arose from the quest for a general solution to the cubic equation, including the duels and secrecy among Renaissance mathematicians. It argues math had to give up the requirement that it mirror reality.
Topic match · Pure mathematics
21:12The Infinite Pattern That Never Repeats
21.9M views • 6 years ago
Veritasium
Veritasium explains how Penrose tilings and quasicrystals overturned the belief that 5-fold symmetry and non-periodic crystals were impossible, including an interview with Paul Steinhardt.
Topic match · Pure mathematics
17:58What P vs NP is actually about
253K views • 2 years ago
Polylog
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.
Topic match · Computability & complexity theory
11:26Do Complex Numbers Exist?
854K views • 5 years ago
Sabine Hossenfelder
Sabine Hossenfelder asks whether complex numbers are just a convenient tool or necessary in physics. She discusses a recent paper arguing that quantum mechanics cannot be done with real numbers alone.
Topic match · Pure mathematics
57:03HACKENBUSH: a window to a new world of math
562K views • 5 years ago
Owen Maitzen
Owen Maitzen's animated hour-long introduction to Hackenbush, a simple combinatorial game, and how its strategy leads to surreal numbers and the roots of the number system.
Topic match · Pure mathematics
21:27How Many Holes Does a Human Have?
16.2M views • 6 years ago
Vsauce
Vsauce asks how many holes a human has and uses topology to show the answer depends on what counts as a hole, with animations and expert input.
Topic match · Pure mathematics
9:27Pentagons Are Terrible at One Thing
20.6M views • 6 years ago
CGP Grey
A CGP Grey video about why pentagons are bad at tiling and why hexagons are so special, in his usual playful style. It touches on honeycombs and tiling in nature.
Topic match · Pure mathematics
21:58Group theory, abstraction, and the 196,883-dimensional monster
3.8M views • 6 years ago
3Blue1Brown
3Blue1Brown introduces group theory and abstract groups, then builds toward classification of finite simple groups and the enormous Monster group with its 196,883 dimensions.
Topic match · Pure mathematics
21:05Why is there no equation for the perimeter of an ellipse‽
2.7M views • 6 years ago
Stand-up Maths
Stand-up Maths explains why the perimeter of an ellipse has no simple closed-form equation, showing the infinite series and presenting approximation formulas.
Topic match · Pure mathematics
23:34Why Democracy Is Mathematically Impossible
10.1M views • 2 years ago
Veritasium
Veritasium explains why no voting system can be perfectly fair, drawing on Arrow's theorem and the work of Eric Maskin. It looks at problems with systems like first-past-the-post and ranked-choice voting.
Topic match · Pure mathematics