ezyang: Kolmogorov complexity, but for LLM prompts
ezyang · x · 2026-09-13
Edward Yang (ezyang), core PyTorch developer at Meta, quipped that Kolmogorov complexity could be applied to LLM prompts — the shortest prompt length needed to produce the same result. A brief, shareable AI-circle witticism.
More from Fun
- Turnbull: Babysitting Frontier Models All Day While X Says They're Superhuman — tszzl · 2026-09-13
- Classic AI meme: 'I'm calling for a slowdown (everyone but me)' — Kyrannio · 2026-09-13
- GPT 6 Astra turns classic Zelda: A Link to the Past into a multiplayer game — TheMoonMidas · 2026-09-13
- YacineMTB: Love Island is literally the Hunger Games, commentators in finery vs naked gladiators in a Skinner box — yacineMTB · 2026-09-13
- Japanese Hacker Builds Starbucks-Themed Device to Vibe Code in Cafes — dshukertjr · 2026-09-13
- Game dev on making AI opponents play by the same rules: 'so much extra work' — draginol · 2026-09-13