Complexity theory joke: OpenAI's 'galactic algorithm' only runs exponential subroutine past n > 10^10^25
brandondamos · x · 2026-10-29
A viral complexity-theory meme: OpenAI's 'galactic algorithm' for resolving the Exponential Time Hypothesis only falls back to an exponential-time subroutine when the variable count exceeds 10^10,000,000,000,000,000,000,000 — effectively infinity plus 1. Dimitris Papail adds that even if ETH is false, you'd need n > (atoms in the universe)^(10^26), joking that a P=NP proof should feel awkward once you require inputs to actually fit in the universe.
More from Fun
- Higgsfield wrapper drama: user rebuilds AI person-swap video workflow in 30 minutes — ravisparikh · 2026-10-29
- Nat Lambert Mocks Teased 'Gemini 4 Carbon' as a Graspy Preemptive Move — natolambert · 2026-10-29
- All-AI SEO playbook fails: agency earns zero backlinks from AI content pipeline — lilyraynyc · 2026-10-29
- "Recursive Sundar Improvement": the Pichai crown meme circulating in AI circles — DynamicWebPaige · 2026-10-29
- Nat Lambert calls out Google: don't announce Gemini scores nobody can try — natolambert · 2026-10-29
- "@X please give us an AI slop button": SEO expert calls for slop filtering — lilyraynyc · 2026-10-29