gaussian integers
2:123D Gaussian Splatting - Why Graphics Will Never Be The Same
2M views • 3 years ago
IndividualKex
A two-minute explainer of 3D Gaussian Splatting, the rendering technique from a 2023 research paper. It outlines why it could change how 3D graphics are made.
17:403D Gaussian Splatting! - Computerphile
273K views • 2 years ago
Computerphile
A Computerphile video in which Dr Mike Pound and PhD student Lewis Stuart explain 3D Gaussian splatting, a quick technique that turns photos of a scene into a 3D model without much compute. It includes a demo and compares the approach to NeRFs.
29:43Pi hiding in prime regularities
2.8M views • 9 years ago
3Blue1Brown
3Blue1Brown shows how pi emerges from prime numbers via complex numbers and sums of squares, culminating in a formula for approximating pi.
7:27Sloane's Gap - Numberphile
1.5M views • 13 years ago
Numberphile
A Numberphile video with Dr James Grime on Sloane's Gap, the observation that integers in the OEIS are not evenly represented and some numbers are underrepresented. It explains the clusters of 'interesting' numbers.
8:00Infinity is bigger than you think - Numberphile
7.7M views • 14 years ago
Numberphile
Numberphile's James Grime explains Cantor's result that some infinities are bigger than others, including why the reals outnumber the integers. It is a short, accessible introduction to countable and uncountable infinity.
5:5015 Sorting Algorithms in 6 Minutes
29.4M views • 13 years ago
Timo Bingmann
A visualization and sonification of 15 sorting algorithms, from selection sort to bogo sort, run on shuffled integers in six minutes. Each algorithm gets a size and speed scaled to its complexity.
17:31How Quantum Computers Break Encryption | Shor's Algorithm Explained
3.4M views • 7 years ago
minutephysics
MinutePhysics explains Shor's algorithm, showing how a quantum computer factors large integers by finding the period of a number modulo N. It walks through the modular arithmetic and number theory that give the exponential speedup over classical factoring, and why this threatens encryption.
1:25Barack Obama - Computer Science Question
1.2M views • 18 years ago
weedipikia
A one-minute clip from Barack Obama's 2008 Google visit in which Eric Schmidt asks him the most efficient way to sort a million 32-bit integers. Obama answers that bubble sort would be the wrong choice.