Deterministic Programming with LLMs
Summary
This essay argues that LLMs are not fully deterministic and that reliability in software should rely on non-stochastic code and tooling. It suggests using linting, tests, and type-system guarantees to enforce consistency, with examples from math-proof tooling and secure coding practices to illustrate how to achieve deterministic deployments and enforce security standards.