OpenAI Disproves Longstanding Computational Complexity Hypothesis, Unlocking New Efficiencies

OpenAI has reportedly disproved a core hypothesis in computer science regarding the inherent difficulty of certain computational problems, suggesting that some problems previously deemed intractable may be solvable efficiently. The claim, sourced from the New York Times, is not yet independently verified and lacks technical detail. If confirmed, this could radically alter algorithmic design and accelerate AI capabilities, with broad implications for cryptography, optimization, and other fields.

AI disclosure: Model-written summary of the source, not a verified fact. Check the sources. How Mosaic works