OpenAI and Anthropic AI models claim to refute computing hypothesis

OpenAI and Anthropic assert that their AI models have posed a challenge to a traditional view concerning the limits of computing. If proven true, the findings can reshape complexity theory. However, neither of the firms has succeeded in creating faster software or in cracking current encryption. A hypothesis from 1999, now under pressure Russell Impagliazzo and Ramamohan Paturi first proposed the Exponential Time Hypothesis (ETH) in 1999. The ETH suggests that there are specific logic problems that require exponentially more computational time as they increase in size. Researchers built on this assumption for decades. According to OpenAI , the number of research papers that used the ETH in proving computational limits in graph theory, databases, computational biology, and so on amounts to hundreds.

BeCrypto News shows a short excerpt and links to the publisher. The full report belongs to Cryptopolitan.