OpenAI and Claude Both Claim 2^o(n) 3-SAT Algorithms, Refuting ETH
pdkj · reddit · 2026-10-27
Both OpenAI's and Anthropic's Claude models reportedly claimed 2^o(n)-time algorithms for 3-SAT on Oct 26, which would refute the Exponential Time Hypothesis. A 43-min explainer video was made with Claude. Such model-generated proofs need rigorous verification, but the claim is a major talking point.
More from Fun
- Viral joke: Anthropic 'disproved gravity' two months ago with its revenue run-rate — basedjensen · 2026-10-28
- Hugging Face's robot Asimov takes its first steps in the office — mishig25 · 2026-10-28
- 'People call themselves technical and all they can do is prompt an LLM' — KevinNaughtonJr · 2026-10-28
- Starlink connection helps rural Zimbabwe doctor complete lifesaving emergency surgery — elonmusk · 2026-10-28
- The AI Momentum Quant meme perfectly roasts half of fintwit — PtrPomorski · 2026-10-28
- Asked LLMs for IPO Soundtracks, Both Picked a 1951 Musical — AndyJoeJoe · 2026-10-28