incr_dom

Yaron Minsky of Jane Street shows how the OCaml Incremental library lets trading UIs express data transformations that are easy to read and efficient on streaming data. It includes a live table demo.

Scott Wlaschin's NDC talk on using statically typed functional programming, F# in particular, to model a business domain. Types are used to represent the domain precisely and to encode business rules so that illegal states cannot be built, with the compiler acting as an instant unit test.

Scott Wlaschin shows how statically typed functional languages, using F# examples, can model a business domain so that invalid states cannot be represented. The type system acts almost like an instant unit test at compile time.

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

A five-minute SuperMemo demo of incremental reading: importing a Wikipedia article on nutrition, extracting passages, making cloze deletions and finishing the item. It lists the keyboard shortcuts used.

Pete Hunt explains why React's virtual DOM was built, how it compares with databinding-style systems, and what it means for future browser technology. Recorded at FutureJS 2014 in Barcelona.

Marcus du Sautoy of the BBC demonstrates the wisdom of the crowd, showing that averaging many guesses of jelly beans in a jar lands near the true count.

Numberphile with Simon Pampena on how humans misunderstand randomness, including coin-flip sequences, run lengths and the gambler's fallacy.

Eben Moglen speaks at NYU in 2010 about freedom in the cloud, arguing that centralized services and handing over personal data and server logs erode privacy and freedom. The talk lays out the motivation for FreedomBox, a personal server for your own data.

Christopher Domas presents his Cantor Dust tool at Derbycon 2012, a 3D visual approach to reverse engineering binaries by visualizing their structure dynamically.

Destin Sandlin of Smarter Every Day explains Multi-Domain Operations through footage from his last mission at RIMPAC 2018. He covers missile and torpedo testing and interviews military leaders about the cyber and information domains.

Chris Domas's DEF CON 23 talk on psychological warfare against reverse engineers. He builds code whose disassembly and control flow graphs mislead, intimidate and demoralize anyone analyzing it.

A Wendover Productions explainer on the political agreements, from the Chicago Convention onward, that determine which airlines can fly where. It lays out the five freedoms of the air.

CGP Grey explains why horses could be ridden and why other animals like zebras and bears were never domesticated for war or riding. It is a follow-up on the topic of animal domestication.

Veritasium explores why the number 37 turns up so often, drawing on Tom Magliery's collection of 37 sightings and a poll of about 200,000 people asked to pick a random number. It covers how humans choose numbers and why 37 stands out.

Eben Moglen's re:publica 2012 talk argues that media which spy on and data-mine the public threaten freedom of thought, and that free technology and free culture are needed to protect it.

Kirsten Dirksen tours the underground ferro-cement dome home of Paula and Bill Lishman, the family behind the geese-led flight story. The skylit earth-sheltered house stays warm below the frost line.

Jafar Husain of Netflix explains at React.js Conf 2015 how Netflix runs React-style rendering without the DOM on smart TVs and game consoles. It uses a canvas-like API for performance.

A two-hour complete longplay of the 1993 MS-DOS puzzle game The Incredible Machine, in which players assemble Rube Goldberg contraptions to complete simple tasks.

Tom Scott visits Cloudflare's San Francisco office to show the wall of lava lamps whose camera feed is used as a source of entropy for random number generation. It is a short explainer on how this helps secure internet encryption.

A ten-minute explainer from Hypermind on the wisdom of crowds, covering Galton's discovery and the diversity theorem. It argues that collective intelligence comes from diversity, independence and aggregation.

Comedian Dominic Frisby gives a ten-minute explanation of land value tax. He argues it would fix problems of rent-seeking and the economics of land ownership.

Christopher Domas presents research at DEF CON 26 showing a hidden alternate instruction set and undocumented hardware backdoor in some x86 processors, found on a third-party CPU. He uses it to ask how feasible wider hardware backdoors are.

Stephan T. Lavavej's GoingNative 2013 talk explaining why calling rand() and using rand() % 100 is bad in C++, and how the C++11 <random> header does the job properly.

Eben Moglen's 2011 Personal Democracy Forum talk on the loss of anonymity and privacy on the internet. He proposes building an alternative net of personal servers, the idea behind FreedomBox.

Harvard professor Arthur Brooks explains why boredom is useful rather than something to avoid. He describes how a wandering mind engages the brain's default mode network, which supports creativity and curiosity, and suggests it may protect against depression.

Greg Young, who coined CQRS, looks back on a decade of domain-driven design, CQRS and event sourcing at DDD Europe 2016. He discusses where event sourcing applies and how simple its core can be.

Dominion is a two-hour documentary using drones and hidden cameras to expose conditions in animal agriculture, including food, clothing, entertainment and research. It questions humanity's dominion over animals.

Christopher Domas's Derbycon 2015 talk on the M/o/Vfuscator, a compiler that emits only x86 mov instructions, showing mov is Turing complete. It explains how a full machine is built from mov and why the output is a nightmare to reverse engineer.

An illustrated 23-minute summary of David Friedman's talk based on The Machinery of Freedom. It describes how law, police and courts could work as market services in a stateless society, covering private law, polycentric law and objections.

Alan Kay speaks at the DEMO Founder School session on why real progress takes invention rather than incremental innovation. He argues for problem-oriented thinking and long-term research funding.

Civilization creator Sid Meier's GDC 2010 talk on applying psychology to game design. He discusses player perception, randomness, and win states, and why designers must account for how players experience events.

Christopher Domas's REcon 2013 talk on dynamic binary visualization for reverse engineering. He shows how rendering binary data as interactive visual maps and trigraphs reveals structure that hex dumps hide, leading to his Cantor.dust tool.

Konrad Malawski's Strange Loop 2023 talk shows how the FoundationDB team adopted Swift incrementally in a C++ codebase. It covers Swift's C++ interoperability, which let them move single functions or entire types over one at a time.

Christopher Domas's DEF CON 26 talk on secret processor registers that vendors reserve for third parties holding trusted keys. He examines how users are locked out of parts of their own CPUs.

A short video of Robert F. Kennedy's 1968 speech criticizing Gross Domestic Product as a measure of progress, saying it counts everything except what makes life worthwhile.

Leptos creator Greg Johnston examines Rust/WebAssembly frontend frameworks against JavaScript frameworks using the JS framework benchmark. He argues that WASM is no longer too slow for DOM-heavy rendering.

Max Brunsfeld of GitHub presents Tree-sitter, a parsing system for programming tools that supports incremental, error-tolerant parsing. He demos its integration into GitHub.com and Atom for syntax highlighting and code navigation.

A five-minute lightning talk from React.js Conf 2016 by Elie Rotenberg on protecting the DOM from tampering. It shows how React tree obfuscation (react-armor) can shuffle class names, tags and tree structure to defeat CSS-selector-based ad blocking.

Numberphile interviews Grant Sanderson of 3blue1brown about Bertrand's paradox, where different reasonable ways of picking a random chord of a circle give different probabilities.