Shaving with Occam
summary
Explains why tiny cores plus simple rules beat sprawling frameworks and shows concrete results: implements a Lisp interpreter in Ruby in about an hour, recounts a Forth-based graphics stack that runs on both an 8080 and PDP‑11 and actually displays the same screens, analyzes a DAC updater whose lockless shortcut yields “one chance in a million” failures but manifests once per day in testing, and cites Erlang process costs of ~3µs CPU / 9µs wall per process and no shared mutable data.
AI-written summary · about
chapters (9)
- 0:00Start
- 5:50How I Got Here
- 15:11Lisp Interpreter
- 23:37Network Layer Protocols
- 42:39Digital-to-Analog Converters
- 49:45Pattern Match
- 53:19Creating Processes
- 1:05:34Tony Moore
- 1:05:53Ways of Constructing a Software Design
