Mocking OpenAI's 'galactic algorithm': an exponential fallback behind a 10^10^25 threshold

qberthet · x · 2026-10-29

X users mock OpenAI's claimed 'galactic algorithm' for resolving the Exponential Time Hypothesis: the trick reportedly 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' — meaning the theoretical speedup is useless at any realistic scale. Replies pile on with 'still O(1)'.

Related event: OpenAI's 'Galactic Algorithm' Mocked for Near-Infinite Threshold(5 posts)→

Original post →

More from Fun

Fun channel →