recommendation algorithm

A Technology Connections video essay arguing that algorithmic feeds make people passive about finding content, leading to complacency in how they seek information. It urges people to actively choose what they consume.

Tom Scott's Royal Institution discourse on science communication in the age of social media, how recommendation algorithms shape popularity, and why view counts can matter more than truth. It includes a segment on parasocial relationships.

Part 1 of Smarter Every Day's three-part series on manipulating the YouTube algorithm. It features Renee DiResta and examples of how social media platforms can be manipulated.

A JSConf 2014 talk visually breaking down algorithms behind everyday UI patterns, such as dropdown menus that vanish when the mouse drifts and picking the nearest target to the cursor. It shows how these are implemented in JavaScript.

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.

Technosociologist Zeynep Tufekci argues that the machine-learning systems used to serve ads also decide what political and social information people see. She explains how opaque algorithms can nudge, segment and manipulate users, and warns that the real danger is powerful people using AI to control populations.

Folding Ideas examines weird, algorithm-gamed children's content on YouTube, from automated toddler videos and educational spam to exploitative prank channels. It looks at how autoplay and recommendation systems reward this material.

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.

PBS Infinite Series explains how Shor's algorithm lets a quantum computer break RSA encryption, building on earlier episodes about cryptography and the math of quantum computers. It works through the idea step by step.

Veritasium's Derek Muller explains his hypothesis that YouTube's algorithm, not viewer preference, drives views, and that click-through rate has become the key metric. He argues this pushes creators toward clickable titles and thumbnails and leads to burnout.

Glenn Vanderburg presents Cló, a Clojure library that reimplements TeX's core typesetting algorithms as composable functions. He shows what translating procedural, literate-programming code into functional form teaches.

A short CGP Grey bonus video explaining the shortest-splitline algorithm, which draws electoral districts by repeatedly splitting a state along its shortest dividing line while balancing population. It is offered as a neutral, algorithmic fix for gerrymandering.

Andrei Alexandrescu's CppCon 2019 talk revisits sorting, showing how branchless tricks, hybrid strategies and a cost metric can speed up std::sort-style algorithms on modern hardware.

Tom Scott-style absurdist tour by Tom7 of SIGBOVIK chess projects: a tournament of 30 weird chess algorithms used to rate a color- and piece-blind chess program. Topics include mirrors, arithmetic encoding, perverted game tree search and a diluted Stockfish.

Martin Donald explains the Wave Function Collapse algorithm using Sudoku-like constraint solving and shows how he implemented it with Blender and Godot. It links demos and reference articles.

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.

Hungarian 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.

Psychologist Robert Epstein presents a Stanford EE380 colloquium on how internet algorithms such as search rankings can manipulate opinions, purchases and votes at massive scale. He also describes a new monitoring system for tracking such influence.

Lex 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.

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.

An ETH Zurich lab demonstration of a failsafe algorithm that lets a quadrocopter detect the loss of a propeller and recover, returning to its original position.

Reducible's visual walkthrough of the Fast Fourier Transform, motivated by polynomial multiplication. It shows how the FFT's key ideas can be discovered by asking the right questions.

Chandler Carruth's CppCon 2014 talk on writing fast C++, explaining why data structure choice and memory layout matter more than clever algorithms. It covers why standard containers like unordered_map perform poorly on modern CPUs.

A three-minute capture of SORTDEMO.BAS, the sorting visualization that shipped with QBasic. It animates insertion, bubble, heap, exchange, shell and quick sort with chiptune-like sound.

Moleman 2 is a feature-length documentary about the demoscene, tracing its rise from 1980s Commodore 64 culture to modern real-time art. It explains the algorithms and creative process behind demos and intros.

Guy Steele presents a small geometric problem and compares four computational approaches: a classic sequential solution and three parallel-friendly ones. Each is illustrated pictorially and with working code, weighing total work against time to solution.

A walkthrough of the Quake III fast inverse square root, explaining where the constant 0x5f3759df comes from. It covers IEEE 754 floats, the bit hack that approximates a logarithm, and a Newton's method refinement.

Sean Parent's GoingNative 2013 talk surveys new and overlooked C++ features and shows how to use them for simple, correct, clear code. It stresses using standard algorithms rather than raw loops.

Chris Stucchio presents the ethical principles behind algorithmic decision making and shows with examples from lending, criminology and education that they cannot all be satisfied at once. The talk frames AI fairness as a set of quantitative tradeoffs.

Linus Tech Tips addresses criticism of its clickbait-style thumbnails in an Honest Answers episode, explaining that the YouTube algorithm pushes creators toward them.

Writer and artist James Bridle shows how strange and disturbing children's videos on YouTube, from surprise eggs to algorithmic mashups, are produced for ad revenue. He argues they reveal problems in a data-driven internet.

A restored 1994 video of Karl Sims' research on evolved virtual creatures, where simulated block creatures are bred through artificial evolution to swim, walk, follow and compete. It is a landmark demonstration of genetic algorithms in physics simulation.

A short comedic complaint by ProZD about YouTube search failing to surface his own video even when searching its exact title. It illustrates how poor search results have become.

SethBling shows MarI/O, a program using neural networks and the NEAT genetic algorithm to learn to play Super Mario World. The description links the source code, the paper and background reading.

A PBS Infinite Series episode explaining the mathematics of quantum computers, including how qubits store complex numbers and how quantum computation differs from classical computation. Hosted by Kelsey Houston-Edwards.

Veritasium tells the story of the Fast Fourier Transform, from its use in detecting nuclear tests to Cold War politics, and how it could have changed the arms race. It includes a short, intuitive explanation of what the Fourier transform does.

Coffee Break analyzes about 40,000 videos from seven months of YouTube's trending tab. It examines whether trending is biased toward mainstream media and late-night shows.

Bryan Cantrill presents the ARC (Adaptive Replacement Cache) paper by Megiddo and Modha at Papers We Love. He opens with a survey of caching strategies before digging into the self-tuning LRU/MFU design.

Lukas Eder's Devoxx talk on how modern cost-based SQL optimizers rewrite and plan queries in ways developers would not expect. It argues that declarative SQL, used well, can run complex queries very fast.

Eli Pariser's TED talk argues that personalized web services trap users in filter bubbles, limiting exposure to challenging information. He says this is bad for individuals and for democracy.