OpenAI and Anthropic Claim to Have Refuted the Exponential Time Hypothesis
OpenAI and Anthropic suggested that the artificial intelligence models they developed discovered algorithms capable of solving complex logic puzzles faster than expected, and that this situation refutes the Exponential Time Hypothesis.
Artificial intelligence models developed by OpenAI and Anthropic have produced new algorithms that are claimed to refute the Exponential Time Hypothesis (ETH), one of the fundamental assumptions of computer science. The hypothesis in question argued that as the number of variables increases in solving certain logic puzzles, the processing time must increase exponentially; however, it was stated that AI models can solve these problems in 'sub-exponential' time.
Computer scientists have formed working groups to evaluate these findings presented by OpenAI and Anthropic. MIT professor Ryan Williams stated that some parts of the solution presented by OpenAI are routine, but the parts that appear 'foreign' require the entire scientific community to work together. Anthropic published its own ETH refutation study shortly after OpenAI's announcement.
Assessment: Experts are discussing the implications of this development on fundamental complexity theories such as P versus NP problems. Ryan Williams stated that these new algorithms do not immediately break existing cryptographic systems, but scientific foundations need to be re-examined. Researchers are seeking consensus on how academic studies will take shape as the role of artificial intelligence in the scientific discovery process increases.
Sources
- techcrunch.com · Link