Gary Marcus mocks OpenAI's new algorithm: exponential subroutine below a 10^25-variable threshold
AlexTensor · x · 2026-10-31
Gary Marcus shared and mocked an OpenAI new result: a post pointed out that OpenAI's "galactic algorithm" for resolving the Exponential Time Hypothesis falls back to an exponential-time subroutine when the number of variables is below 10^10,000,000,000,000,000,000,000,000 — effectively infinity for practical purposes. Marcus quipped its practical value is "immense, except on virtually any real-world problem."
The exchange highlights the gap between theoretical CS results and practical usability, and has become a flashpoint of AI-circle banter.
More from Research
- Santa Fe Institute publishes interactive history of agent-based modeling — round · 2026-10-31
- Peking University's DragMesh turns static 3D assets into articulated objects with one drag, accepted to IJCV — jiqizhixin · 2026-10-31
- Higher reasoning effort doesn't help AI agents catch silent failures, τ-bench test finds — TruthDeep8659 · 2026-10-31
- 'The Proof in the Code' named among 2026's best nonfiction: the story of Lean and human-AI collaboration — rbhar90 · 2026-10-31
- T-DIG uses an LLM to control any text-to-image model without weight access — simi_97k · 2026-10-31
- Ebolathon: AI agents design 140 molecules, 11 selectively block Ebola pseudovirus in lab — GabriCorso · 2026-10-31