ETH concerns how hard Boolean satisfiability is to solve; researchers have used it to show problems in graph theory, computational biology and databases are hard to solve quickly, according to TNW.[1] OpenAI checked the result in Lean, a language that verifies proofs by machine, and posted it on GitHub.[1] Russell Impagliazzo and Ramamohan Paturi of UC San Diego, who first proposed ETH, will examine it with Ryan Williams of MIT; they wrote that their involvement "should not be taken as certification of the claim."[1]
ETH proposers to examine claim, say involvement is not certification
ETH concerns how hard Boolean satisfiability is to solve; researchers from UC San Diego and MIT who will examine it wrote that their involvement "should not be taken as certification of the claim."
2 primary · 1 independent · 0 commentary · 1 vendorSources
- OpenAI says its AI model has disproved the Exponential Time Hypothesis TNW | Openai Independent
- Computational Math with Neural Networks is Hard arXiv.org Primary
- Working with academic communities to build scientific understanding OpenAI PrimaryVendor