OpenAI's 3SAT Claim Only Wins at Universe-Scale Variable Counts

Paras Chopra notes that OpenAI's claimed sub-exponential 3SAT algorithm only beats brute force when variables exceed 10^(2×10^10), more than atoms in the observable universe. The debate traces back to Ben Recht's blog post criticizing complexity theory's failure to rigorously define efficiency.

2026-11-14 ~ 2026-11-14 · 2 related posts