Create

Sign in to ReadmeX

or

How we handle your data: Privacy Policy

ReadmeX

Your AI reading companion

What would you like to catch up on?

Pick a briefing, or ask your own question.

Your community and people briefings stay personal to you.

Paper Club

OpenAI Claims Disproof of Exponential Time Hypothesis

The New York Times reports that OpenAI has claimed to disprove the Exponential Time Hypothesis, a longstanding theory that some problems would always be hard for computers to solve quickly. Co-proposer Russell Impagliazzo called the claimed disproof “shocking news.” The supplied report does not provide technical details or independently verify the result, and says the claim could one day speed up chip design and break encryption. Why it matters: The report says the claimed disproof could one day speed up chip design and break encryption, but those remain possible future implications rather than demonstrated outcomes. What do you think?

Open the headline: source, AI briefing and more →

Comments

…