Barry Stahl
where else to find them
no profile links on file
what they talk about
all 9 in the filters
where they keep going back
- codemash.org2 editions2025–2026
- NDC Oslo2 editions2021–2022
all 5 in the filters
on a stage with
never shared a talk
who talks about the same things
- Coraline Ada Ehmke24 talks
- Jimmy Bogard50 talks
- Nimisha Asthagiri5 talks
- Layla Porter35 talks
- Ariel Caplan9 talks
- Michael Feathers23 talks
| title | conference | date |
|---|---|---|
| Solutions That Evolve: Building Self-Improving Systems with Genetic Algorithms | NDC London 2026 | 2026-01-26 |
Genetic algorithm encodes a Shoots-and-Ladders strategy as a 299-gene chromosome (679 total alleles) producing about 10^103 possible strategies, runs six… | ||
| Law & Order: Corporate Intent | CodeMash 2026 | 2026-01-13 |
Claims that binding arbitration clauses funnel disputes into a private system that favours repeat corporate players rest on interviews with counsel, a senior… | ||
| How the Fediverse Could Save Democracy | CodeMash 2025 | 2025-01-14 |
Claim: a federated social web could reduce algorithmic amplification and corporate control and so help save democracy but adoption barriers make success… | ||
| Amazing Algorithms for Solving Problems in Software | NDC Oslo 2022 | 2022-09-26 |
Simulations show a 20-node best-path problem solved with bee and ant colony heuristics, a 40-firefly swarm optimizing the Mikhailovich test surface, and an… | ||
| Eliminating Hidden Dangers to Your Applications Patterns for Reliable Systems | NDC Oslo 2021 | 2021-11-29 |
Claim: it is impossible to reliably make two independent state changes in a single execution context, so avoid the Dual-Writes anti-pattern. Concrete… | ||
| Design Patterns for Loosely Coupled Applications | Craft Conference 2019 | 2019-05-07 |
Argues that loose coupling cuts maintenance costs and shows a concrete C#/.NET Core refactor: a one-file console app reading a month-file becomes separate… | ||
| Building AI Solutions with Google OR-Tools | NDC Sydney 2017 | 2017-08-14 |
Shows how to model and solve real problems with Google OR-Tools, from Sudoku pruning a 10^77 search space down to about 10^21 using all-different constraint… | ||
| nothing matches | ||