concurrency limits

Not Just Bikes explains how North American speed limits are set and why posted limits matter far less than street design. It argues that drivers follow the road's cues, so safe speeds have to be built into the street.

Rob Pike's Go talk distinguishing concurrency, the structuring of independent processes, from parallelism, their simultaneous execution. It uses Go channels and goroutines to illustrate.

Nathaniel J. Smith's PyCon 2018 talk introducing Trio, a Python concurrency library designed around usability and structured concurrency. He live-codes a problem and analyzes pitfalls in other async libraries.

Rob Pike's 2010 talk at OSCON's Emerging Languages Camp on where Go's concurrency style comes from. It traces the idea from Hoare's CSP through Squeak, Newsqueak and Limbo to Go.

Jonathan Worthington's YAPC Asia 2015 talk on parallelism, concurrency and asynchrony in Perl 6. It covers the language's concurrency features.

A documentary on the 1972 Club of Rome study Limits to Growth, which questioned the pursuit of endless economic growth. It covers the study's findings and whether anyone acted on them.

Rob Pike's Google I/O 2012 talk shows how goroutines and channels solve tricky concurrency problems with simple Go code. It features a playful goroutine demo with gophers passing messages and a search engine example.

Rich Hickey's long presentation on Clojure and concurrency covers locking and immutability, then goes in depth on refs, transactions and agents. It ends with a multithreaded ant colony simulation demo.

Raymond Hettinger's PyBay 2017 keynote on concurrency in Python. It covers threads, processes, asyncio, locks and the GIL, with live shell-based examples.

Jon Moore's Strange Loop 2017 talk argues that rate limiting is the wrong tool for protecting services from noisy clients. He proposes concurrency-based capacity management and quotas instead.

A panel with Tony Hoare, Joe Armstrong and Carl Hewitt, hosted by Francesco Cesarini, on the history and future of concurrency. The three creators of CSP, Erlang and the actor model discuss their differing approaches.

Noam Chomsky's 2011 University of Oslo lecture on Newton's contributions to the study of mind. He argues Newton abandoned mechanical explanation and lowered the bar for scientific intelligibility, with consequences for the limits of human understanding. Q&A starts at 45:33.

Lex Fridman's long podcast interview with Yann LeCun on Meta AI, open source, the limits of LLMs, AGI and the future of AI.

Hillel Wayne's Strange Loop talk introducing TLA+ as a specification language for finding concurrency bugs in designs. It covers stalling, race conditions and dropped messages, with PlusCal examples.

A Google Tech Talk by the author of Kilim, a Java library for lightweight actor-style message passing. It argues that message passing can replace shared-memory concurrency and claims performance competitive with or better than Erlang for huge numbers of actors.

Kurzgesagt explains why, even with science-fiction technology, most of the universe is permanently out of reach because of cosmic expansion and finite resources.

An animated short on limits to growth, covering oil formation, peak oil, energy, economic growth and resource depletion. Its central section deals with exponential growth, and the author notes some statistics are dated.

Go runtime contributor Dmitry Vyukov looks inside the Go scheduler, explaining how goroutines and channels are implemented. He covers the main scheduler components and overall operation, then goes into details such as preemption and stacks.

David MacKay's TEDxWarwick talk uses basic arithmetic to show how much land and energy renewables would need to power a country like the UK. It explains the limits of sustainable options and why they should still be pursued.

Yann LeCun on the Big Technology Podcast discusses why current AI models cannot make discoveries despite their knowledge. He argues systems need abstract world models and also covers limits of AI research, investor expectations, and open source after DeepSeek.

Sasa Juric explains what makes Erlang and Elixir suited to server-side systems, focusing on the BEAM concurrency model rather than syntax or ecosystem. He demonstrates processes, supervision, and fault tolerance.

Will Wilson of FoundationDB explains how the team tested their distributed database using deterministic simulation. By running the whole system in a simulator with injected faults and reproducible seeds, they could find rare concurrency and network bugs.

A Channel 9 Going Deep interview in which Brian Beckman talks with Rich Hickey, creator of Clojure, about the language's design. It covers Clojure's persistent data structures, reference types and its approach to concurrency on the JVM.

David Beazley's workshop screencast builds asynchronous programming in Python from scratch, starting from callbacks and continuations and replacing threads to show how concurrency works underneath.

Zig creator Andrew Kelley's RedisConf 2020 talk on modeling data flow with asynchronous I/O in Zig. It explains how Zig's async/await avoids function coloring, and Loris Cro demonstrates OkRedis, a zero-allocation Redis client.

A Stanford EE380 seminar by Michael P. Frank of Sandia National Laboratories on generalized reversible computing. It surveys unconventional computing approaches as transistor scaling nears its limits and energy efficiency stops improving.

CppCon 2014 talk by Jeff Preshing on how Ubisoft Montreal developed games for multicore hardware, before and after C++11 concurrency support. It goes into atomics and lock-free programming in practice.

A short satirical sketch in which a Q&A about web servers turns into a profane rant about threads, blocking and non-blocking I/O. It lampoons the hype around Node.js and async programming.

Physicist and YouTuber Angela Collier argues in this hour-long video that AI as commonly described does not really exist. She covers the limits of the tools, biased datasets, and why they should not be used to make decisions.

Rob Pike presents Go Proverbs at Gopherfest 2015, a set of pithy aphorisms about Go design such as 'Clear is better than clever' and 'A little copying is better than a little dependency'.

Rob Pike's October 2009 Google Tech Talk introducing Go, a new experimental systems language designed for fast builds, concurrency and garbage collection. It covers the goals, syntax and type system.

Rob Pike shows how the Go text/template lexer is built, using state functions, goroutines and channels. The talk was given at a Google Technology User Group in Sydney in 2011.

Herb Sutter's deep C++ and Beyond 2012 talk on atomics and the C++ memory model, covering why programmers chasing top performance need to understand hardware ordering. This is part one of two.

Paul Turner of Google presents kernel interfaces for user-level scheduling of real threads, aiming at a uniform synchronous programming model across C++, Java, Go and Python. It introduces the switchto-style system calls behind Google's fibers.

A standing whiteboard conversation at Lang.NEXT 2012 among Carl Hewitt, Erik Meijer and Clemens Szyperski about the actor model. Hewitt, who originated the model, explains its foundations.

A 2007 Google Tech Talk in which Cliff Click of Azul Systems presents a lock-free concurrent hash table that scales to 768 CPUs. He explains why it is correct by reasoning in a different way than usual happens-before and memory-order arguments.

The preface to Herb Gross's MIT OpenCourseWare 'Calculus Revisited: Single Variable Calculus', an older black-and-white lecture series. It introduces his approach to teaching calculus from the basics.

David Beazley's PyCon 2010 talk explains how the Python Global Interpreter Lock works and shows experiments where multithreaded code runs slower, even on more cores, due to lock contention and context-switching overhead.

A short Ericsson film demoing Erlang, showing concurrent processes, debugging tools, and hot code reloading, including crashing parts of a running system while calls continue.

Fedor Pikus's CppCon 2017 talk on C++ atomics, looking at what they let the programmer express and what the hardware actually does. It covers memory ordering and lock-free programming from basic to advanced.