Dev mocks OpenAI's "galactic algorithm": exponential-time subroutine below 10^10^28 variables

beenwrekt · x · 2026-10-28

Developer beenwrekt poked fun at OpenAI's claimed algorithm for resolving the Exponential Time Hypothesis: it runs an exponential-time subroutine whenever the variable count is below 10^10,000,000,000,000,000,000,000,000 — a number he calls "infinity plus 1," mocking the practical uselessness of the theoretical claim.

Original post →

More from Fun

Fun channel →