factual
Ten-layer network amortizes an NP-class search
The profound accomplishment of AlphaGo is that roughly ten sequential layers of neural-network computation can amortize and approximate to high fidelity a nearly intractable, NP-class search problem—suggesting our worst-case-complexity framing of hard problems may be incomplete, since hard problems often have exploitable structure.
factualpending
Speaker
Eric JangEvidence Quote
“It actually makes me wonder if our understanding of problems like P=NP, or these fundamental computational hardness problems, is incomplete.”
Created: 6/13/2026, 3:37:56 AM
Your notes
Loading notes...