control algorithms

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.

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.

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.

Andreas Antonopoulos argues that money has a fourth function beyond store of value, medium of exchange and unit of account, which is as a system of control. He covers the history of money and why it does not flow freely.

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.

Linus Torvalds gives a Google tech talk on git, the source control system he created two years earlier. He argues for distributed version control over centralized systems such as CVS and Subversion.

SQLite author Richard Hipp's talk at SouthEast LinuxFest criticizing Git's workflow and introducing Fossil as an alternative. He lists Git enhancements and argues for keeping history intact.

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.

Kevin Spacey, giving the MacTaggart Lecture at the Edinburgh Television Festival, urges TV channels to give viewers control. He points to Netflix's House of Cards release as evidence that audiences want to watch on their own terms.

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.

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.

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.

Richard Stallman's TEDxGeneva 2014 talk describing how nonfree programs give companies control over users and what users can do to regain control. It introduces the free software movement and the four freedoms.

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.

Andrei Alexandrescu's CppCon 2015 talk on handling exceptional control flow declaratively in C++. It uses scope guards with success and failure variants, built on std::uncaught_exceptions, to replace ad hoc RAII classes and rethrowing try/catch blocks.

Dan Tentler shows a rapid-fire tour of insecure things found on the open internet using Shodan and his own scanning, from unprotected VNC endpoints to industrial controls. The emphasis is on how little security was considered before connecting them.

Deviant Ollam's two-hour conference talk explains how elevators work, from the pit and buffers to the car top, controller logic and access-control features. It shows how this knowledge can be used for optimization and for bypassing building security.

Rick Hartley's AltiumLive keynote on differential pairs in PC boards. He argues the rules from cables and twisted pairs do not carry over, and covers which pair geometry gives the best impedance control, the right spacing, routing practice and how much skew is acceptable.

Evan Czaplicki's Strange Loop 2014 talk surveys the many formulations of functional reactive programming and how they relate historically and theoretically. It then shows how Elm's variant enables hot-swapping and its time-traveling debugger.

Rachel Potvin describes the scale of Google's codebase and its custom monolithic source repository. She explains the reasons for the monorepo model, the tooling that makes it workable, and its tradeoffs.

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.

John Ousterhout's Netdev 0x16 keynote arguing that nearly every aspect of TCP is wrong for the datacenter, from connections and streams to reliable delivery and congestion control. He presents the case for a replacement protocol.

In a TED talk, behavioral economist Dan Ariely uses visual illusions and his research to show that people are less rational in their decisions than they think. He covers defaults, such as organ donation rates, and how choice framing steers decisions.

In an 11-minute TED talk, Ralph Langner explains how his team reverse-engineered the Stuxnet worm and worked out that it targeted industrial control systems, with a covert state origin. It is a compact look at cyber-forensics.

Hamish Coleman describes reverse engineering the keyboard controller in a Thinkpad and reflashing it with custom firmware. He covers how Lenovo secures its firmware, and his ongoing work on the protocol between the BIOS and the vendor flash tool.

Neuroscientist Anil Seth argues in this TED talk that perception is a controlled hallucination: the brain constantly predicts the world and our shared agreement is what we call reality. He also touches on the construction of the self.

A 36C3 talk on the AMD Platform Security Processor, an undocumented ARM core inside AMD CPUs that runs before the main processor. The speakers present their reverse engineering of its internals.

Sam Harris argues in a TED talk that we will build superhuman AI and have not grappled with the risk of creating something that may treat us the way we treat ants. He makes a logical case for taking AI risk seriously.

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.

Noam Chomsky speaks at Google Cambridge in 2017 about his political development and the control of information and media. It is a wide-ranging talk with audience discussion.

An Apple WWDC24 session introducing Embedded Swift, a subset of Swift with no runtime that targets tiny microcontrollers. It demonstrates the idea on an off-the-shelf Matter smart home device.

A Linux.conf.au 2013 talk that explains git's internal model using a playful, toy-based approach. It presents git operations as operations on a graph of commits, aimed at people who find git confusing.

Scott Chacon introduces Git by showing what happens under the hood for basic commands: staging, committing, data storage, branching, merging and pushing. He contrasts it with Subversion and shows history viewing with log.

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.

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.

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.

Retired Major Brian Shul tells the story of a ground speed check with LA Center while flying the SR-71 Blackbird. He recounts it live at the Hiller Aviation Museum.

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.