Cryptographer mocks OpenAI's exponential-time subroutine bound: 'infinity plus 1'
matthew_d_green · x · 2026-10-29
Cryptographer Matthew Green joins the pile-on over an OpenAI-associated algorithm claim: critics note the supposed algorithm for resolving the Exponential Time Hypothesis runs an exponential-time subroutine whenever the variable count is below 10^10,000,000,000,000,000,000,000,000 — jokingly called "infinity plus 1." Green quips that within a week someone could probably get the bound down to 2^1000.
Related event: OpenAI's 'Galactic Algorithm' Mocked for Near-Infinite Threshold(5 posts)→
More from Fun
- Musician makes tracks on a graphing calculator, hits 16K monthly Spotify listeners — measure_plan · 2026-10-29
- DavidKPiano jokes the 'new touchscreen MacBook Pro' is just an iPad with a keyboard — DavidKPiano · 2026-10-29
- Genie 4 demo: chilling in a Japanese onsen with pettable capybaras — venturetwins · 2026-10-29
- One prompt one-shots a walkable 3D ship where AI agents visibly work around the clock — InternationalGap3698 · 2026-10-29
- Dev suggests Codex, Claude Code, Cursor add a GitHub-style activity wall to flex AI usage — gethackteam · 2026-10-29
- The classic 'see you in 2 weeks' meme, now aimed at Google's model cadence and rate limits — Bitter-College8786 · 2026-10-29