shor's algorithm

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.

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.

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.

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.

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.

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.

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.

Adam Robinson-Yu's GDC 2020 talk on how he shelved a big project to prototype what became A Short Hike. He covers the solo development process and technical choices like a pixel shader over low-poly models.

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.

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.

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.

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 short conference talk from !!Con 2017 in which Kevin Chen explains the HDR imaging algorithm from a foundational paper, framing it as a system of linear equations, and implements it in a Microsoft Excel spreadsheet. No prior image processing knowledge is needed.

A three-minute video from Derek Sivers, based on his book Anything You Want, about remembering that the people you deal with online are real people. It contrasts how we treat people face to face with how we treat them online.

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.

In a TEDGlobal talk, Raffaello D'Andrea demonstrates quadcopters that play catch, balance, learn and coordinate, using algorithms that treat them like athletes. It includes Kinect-controlled quads.

An 88-minute Microsoft Research talk that explains how quantum computers beat classical ones using basic linear algebra, qubits, superposition and gates. It works through the Deutsch oracle problem and ends with entanglement, teleportation and a live demo.

Daniel J. Bernstein and Tanja Lange survey recent highlights in post-quantum cryptography at 35C3, covering the NIST competition, network protocol experiments, and broken candidates.

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

A short talk by Will Dayble of Squareweave arguing that you should design software as if the user were drunk: distracted, impaired in attention and vision, and prone to misreading. It is a user experience talk built around that framing.

Esther Gokhale's short TEDx talk argues that the natural human spine is curved rather than straight and teaches a 'primal posture' for sitting without back pain.

Jon Bentley walks through three implementations of Hoare's Quicksort, from a dozen-line C function to a series of systematic code transformations that make the program ever simpler and more powerful. It is a Google Tech Talk on code elegance and program derivation.

Edward Kmett's 2013 talk at Prezi in Budapest on succinct data structures, which store data in close to the information-theoretic minimum space while supporting fast queries. It ties together the research and walks through his Haskell succinct library.

Donald Knuth explains at Stanford's CCRMA the constraint-based methods he is using to compose a major work for pipe organ.

Lawyer and musician Damien Riehl argues that music is math with a finite number of melodies, and describes how he and programmer Noah Rubin generated every possible melody and released them under CC0 to avoid accidental infringement claims.

A 2007 Google Tech Talk introducing Polyworld, an artificial life simulator used to evolve artificial intelligence by designing worlds rather than minds. It presents results from ongoing attempts to evolve intelligent behavior.

Richard Cook's short Velocity 2013 talk on resilience in complex adaptive systems, arguing systems operate near the edge of failure and that the surprise is how rarely they fail. He presents a model of how pressures push systems toward failure boundaries.

Andrew Ng presents unsupervised feature learning and deep learning, showing how algorithms can learn representations from unlabeled data instead of hand-designed features. He gives examples in vision and audio, including visualizations of features learned by successive layers.

Brian Lonsdorf explains why Underscore.js falls short as a functional programming library, then introduces currying, composition and point-free style in JavaScript. He argues for data-last argument ordering.

Douglas Adams gives a talk at UCSB, recorded shortly before his death, about the odd lives of animals and what they suggest about humanity's future. It draws on his Last Chance to See work and is funny and wide-ranging.

A five-minute clip of Ira Glass on the gap between good taste and early creative work. He says beginners know their work falls short and must keep producing to close the gap.

A short SIGBOVIK 2017 presentation by Tom Wildenhain showing that PowerPoint animations are Turing complete, with a working Turing machine built in slides. The talk is delivered deadpan as a serious research result.

Shashi Tharoor's Oxford Union speech arguing that Britain owes reparations to its former colonies, focused on the effects of British rule in India. It lists economic and political damage done by colonialism.

A short !!Con 2016 talk by blind developer Sina Bahram on how he uses a computer and writes code with a screen reader at about 1,000 words per minute. He plays how common interfaces sound and challenges the audience to go a day using only the keyboard.

A short clip of Dr. Robert Zubrin, author of The Case for Mars, answering why humanity should go to Mars. He argues that societies grow by challenging themselves and that exploration inspires young people.

Rich Hickey introduces transducers in Clojure, a way to make map, filter and similar algorithms composable independent of the data source. This avoids duplicated implementations and intermediate collections across sequences, channels and streams.

Julia co-creator Stefan Karpinski explains why multiple dispatch makes Julia code and types reusable across packages with so little friction. He covers sharing basic types and sharing generic algorithms.