OpenAI bot 'cracks' 27-year-old code rule in 10 days, and geeks are sweating
MindStudio reports that OpenAI says its AI system produced a disproof of the exponential time hypothesis, a 1999 conjecture. The hypothesis holds that hard problems, such as the classic satisfiability problem, cannot be solved meaningfully faster than brute force in the worst case. OpenAI says the work took 10 days. If the result survives review, results built on the hypothesis would need rethinking. The report notes OpenAI's president says P probably still does not equal NP.
From mindstudio.ai's report.
Why it matters: If the claimed disproof of a 1999 computing conjecture survives review, results built on it would need rethinking, affecting computer scientists, and it shows AI may produce research-level math in days.
Comments
No comments yet.