ClaimsDemis Hassabis

“it could potentially have big implications for complexity theory including P=NP”

Demis Hassabis December 2024 Accelerating scientific discovery with AI (Nobel lecture slides) (NobelPrize.org)

Not checkable

it could potentially have big implications for complexity theory including P=NP

Not checkable An opinion, value judgement or statement with nothing to check.

Not checkable: An opinion, value judgement or statement with nothing to check. Not scored.

Cite this claim

Demis Hassabis, “it could potentially have big implications for complexity theory including P=NP” (said December 2024). Verdict: not checkable. Reliability API, claim c_3723f5958686, method 0.1.0+c876030c, dataset release v1.1.2. https://epistacklabs.com/claims/c_3723f5958686

This claim is in dataset release v1.1.2, with the same verdict.

Reply to this claim

For Demis Hassabis, or someone speaking for them: a correction or counter-evidence. Replies are read before anything is shown; an approved reply shows your name, role, date, statement and link. Your email address is never shown and is deleted 30 days after the decision (privacy).

Verdicts are made automatically; how verdicts are made.