Themata.AI
Follow coverage
Themata.AI
LatestTop

Filtering by tag:

Computer scienceClear

Latest stories

  1. AI cracks a 27-year-old pillar of computer science, OpenAI and Anthropic claim
    OpenAIAnthropicLLMsComputer science
    News

    Story · 1 report

    AI cracks a 27-year-old pillar of computer science, OpenAI and Anthropic claim

    OpenAI and Anthropic separately released proofs that they say refute the exponential time hypothesis (ETH), a 1999 conjecture that solving satisfiability problems cannot avoid exponential growth in computational effort. Both companies said their models found the results on 16 October, using different proof routes, and said the Lean proof-checking language formally verified them. Human experts have not yet fully confirmed either proof, and Russell Impagliazzo, co-creator of ETH, said the result is not yet 100% certain. ETH underlies claims about the difficulty of satisfiability, a class of problems relevant to chip design, scheduling, and cryptography. Refuting it would not solve the P versus NP problem, but it would mark progress toward that longstanding question and could require researchers to revisit results based on ETH. Anthropic identified more than 800 papers relying on ETH or a stronger version. Its paper says the new method is unlikely to outperform brute-force search for instances with fewer than roughly 10 million switches, limiting near-term practical effects. OpenAI asked Impagliazzo, ETH co-author Ramamohan Paturi, and MIT computer scientist Ryan Williams to help make its initially unreadable proof accessible. The group plans a human-readable version and a virtual review conference before year-end. OpenAI also released work on the Kakeya conjecture and submitted a 1,147-page quantum Yang-Mills proof to a committee chaired by Nobel laureate David Gross, which has not released it pending review.

    science.org

    🔥🔥🔥🔥🔥

    2 min summary

    10/30/2026

    Read report
  2. Working with academic communities to build scientific understandingResearch

    Story · 1 report

    OpenAi claims to have proved that the Exponential Time Hypothesis is false, invalidating many past results that relied on it being true.

    OpenAI announced AI-generated results in harmonic analysis, computational complexity, and quantum field theory, alongside three different community-led review and release processes. The company said its models proved Sogge’s local smoothing conjecture in every dimension, which would also resolve the Kakeya and Stein restriction conjectures in all dimensions. It released the natural-language output and a Lean formalization on GitHub after obtaining the result on October 18, 2026 and formalizing it the next day. OpenAI also said its system found a disproof of the Exponential Time Hypothesis on October 16 and formalized it in Lean on October 17. A collaboration led by UC San Diego’s Russell Impagliazzo and Ramamohan Paturi and MIT’s Ryan Williams will examine the claim; OpenAI has released the proof materials and committed to fund a conference on its implications. For physics, OpenAI said its models produced rigorous existence proofs for four-dimensional gauge theories with fermions, including QCD, and for pure Yang–Mills theory. David Gross will lead a group of physicists to assess and write up the work, while AI-produced artifacts remain unreleased. OpenAI said participants are voluntary, unpaid, free to publish conclusions, and not required to sign nondisclosure agreements.

    openai.com

    🔥🔥🔥🔥🔥

    1 min summary

    10/26/2026

No more articles to load