Tag
The article models chess as a concurrent system and derives state and transition invariants, demonstrating formal verification techniques using TLA+.
The article argues that structural backpressure (e.g., compilers, type checkers) is more effective than improving AI models for ensuring code correctness, and introduces Shen-Backpressure as a tool to implement this approach.
Explores the distinction between illegal and unwanted states in software systems, arguing that unwanted states are sometimes necessary and must be explicitly modeled.