Philip Wadler - Propositions as Types (Lambda Days 2016)
In briefPhilip Wadler's Lambda Days talk on propositions as types, the link between logic and computation that underlies theorem provers and programming language design.
Math & Theory
Page 10 of 15
-
-
A Tour of Prolog
In briefMarkus Triska tours Prolog's most distinctive features, including its use as a database and query language, rule processing, constraint solving and compile-time rewriting. It also covers concise meta-interpreters.
-
Bayes theorem, the geometry of changing beliefs
In brief3Blue1Brown presents Bayes' theorem through a geometric diagram, showing how evidence should update beliefs. It works through the Kahneman and Tversky style questions and base rates.
-
Justin Bieber 800% Slower
In briefA Justin Bieber song slowed down 800% with the PaulStretch program, turning a pop track into a long ambient drone.
-
Jordan Peterson - Pareto Distributions
In briefA short clip of Jordan Peterson explaining Pareto distributions, using Soviet farm collectivization and the resulting famine as context. It also covers how outcomes concentrate in a few people.
-
Barliman: trying the halting problem backwards, blindfolded - William Byrd, Greg Rosenblatt
In briefA Clojure/conj 2016 talk demoing Barliman, a prototype smart editor that does program synthesis. Given a partial program and tests, it completes the program using a relational interpreter written in miniKanren.
-
1.1 - Course outline
In briefCourse outline for Stanford's online GNSS course, introducing how GPS works and the many uses of satellite navigation. The series pairs short lectures with backyard experiments using smartphones.
-
Extremely Large Numbers 1 - Introduction
In briefThe first video in a series on extremely large numbers, introducing the topic with examples. Later parts go deep into the fast-growing hierarchy.
-
Quick-sort with Hungarian (Küküllőmenti legényes) folk dance
In briefHungarian folk dancers from Sapientia University act out the quicksort algorithm step by step, with music. It is part of the AlgoRythmics series of sorting algorithms performed as dance.
-
ASTOUNDING: 1 + 2 + 3 + 4 + 5 + ... = -1/12
In briefA Numberphile video in which physicists Tony Padilla and Ed Copeland show a seemingly astounding result that 1+2+3+4+... equals -1/12. The argument is informal and has drawn criticism for glossing over what the result actually means.
-
Quantum Computing Expert Explains One Concept in 5 Levels of Difficulty | WIRED
In briefIBM's Dr. Talia Gershon explains quantum computing to five people of increasing expertise: a child, teen, college student, grad student and professional. The WIRED series format moves from simple analogies to technical detail.
-
What Happens When Maths Goes Wrong? - with Matt Parker
In briefMatt Parker's Royal Institution talk based on his book Humble Pi, covering everyday mathematical mistakes and spurious patterns that went wrong in engineering and software. It mixes stand-up comedy with stories of coincidence and error.
-
David Kriesel: Lies, damned lies and scans
In briefDavid Kriesel's FrOSCon talk on how Xerox scancopiers, due to JBIG2 compression, silently replaced digits in scanned documents. He walks through how he discovered the bug and why it is so dangerous.
-
Strange Spheres in Higher Dimensions - Numberphile
In briefMatt Parker on Numberphile explains the strange properties of spheres in higher dimensions, such as how they poke out of their bounding boxes. It uses Pythagoras to build intuition for 4D and beyond.
-
Floating Point Numbers - Computerphile
In briefTom Scott explains for Computerphile how floating point numbers work, why moving the binary point is fast, and why it handles money badly.
-
Why do Biden's votes not follow Benford's Law?
In briefMatt Parker examines claims that Biden's 2020 vote counts violate Benford's Law, explaining the law and why it often does not apply to precinct-level election data.
-
Quantum Expert Insight: Peter Shor
In briefPeter 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.
-
Donald Knuth: Algorithms, Complexity, and The Art of Computer Programming | Lex Fridman Podcast #62
In briefLex Fridman interviews Donald Knuth about algorithms, complexity, The Art of Computer Programming, and his work habits. The conversation covers his approach to verifying algorithms and how he organises his time.
-
Naive empiricism, terrorism & Ebola.
In briefNassim Taleb argues that evidence on terrorism risk presented in media is statistically naive, using extreme value theory without math to separate fat-tailed risks like Ebola and terrorism from thin-tailed ones.
-
Clutching at Random Straws, Matt Parker | LMS Popular Lectures 2010
In briefMatt Parker's LMS popular lecture on how seemingly incredible results can be meaningless random patterns. He ranges from ancient Woolworths civilisations to shoelaces and DNA.
-
Simulating alternate voting systems
In briefPrimer uses simulations to compare voting systems such as first-past-the-post, approval, ranked choice and others. It shows how each system behaves and can be manipulated, with links to further voting theory resources.
-
Math Magic
In briefVsauce explores math through card tricks and big numbers, including an animation of how enormous 52 factorial, the number of deck orderings, really is.
-
How We Should Vote (Range Voting)
In briefA six-minute explainer from Undefined Behavior on range (score) voting. It follows an earlier video on Arrow's Theorem and shows how range voting seems to satisfy the criteria Arrow's Theorem says no ranked system can.
-
Lisp at the Frontier of Computation, by Robert Smith at Rigetti Computing
In briefRobert Smith of Rigetti Computing talks at a Bay Area Lisp and Scheme meetup about using Common Lisp for quantum computing. He covers the technical, sociological and psychological sides of working across disciplines.
