Hypothetical Divine Signatures
A truly omniscient deity would prove itself through computational complexity, not faith—providing mathematically verifiable signatures rather than miracles.
Haskell developer and author. Writes about functional programming, compilers, and type theory.
https://www.stephendiehl.comA truly omniscient deity would prove itself through computational complexity, not faith—providing mathematically verifiable signatures rather than miracles.
Four readable Rust implementations of type systems from Algorithm W to dependent types, designed as starting points for building type checkers.
LLMs won't replace programmers; they're powerful but flawed tools requiring expert guidance, not autonomous coding savants as hyped by influencers.
AI tools are genuinely useful for developers, but the speculative hype and quasi-religious fervor around them has become unsustainable—a bubble burst would benefit software's future.
Modern life pits our ancient brains against profit-driven algorithms designed to capture attention; the only real solution is to completely opt out.