Rethinking a P≠NP world via hierarchy theorems and the natural proofs barrier
MoonL88537 · x · 2026-09-09
The post quotes a thread by @bzogrammer as "a very cool way to think about P vs NP." The thread argues P≠NP is more likely and is the world we empirically live in, offering an under-discussed angle downstream of the natural proofs barrier: complexity theory is full of hierarchies — e.g. the time hierarchy theorem, where a machine allowed to run longer strictly computes more — a linear way of defining ever more powerful machines and strictly comparing capabilities.
More from Research
- NumeriaPlus: 300-hour egocentric activity dataset with dense ground truth for world models — ducha_aiki · 2026-09-09
- OpenAI claims 10,000 agents proved Navier-Stokes blowup in 88 hours; Clay Institute won't accept it — AdaptiveAgents · 2026-09-09
- Programmable Cellular Automata: readable code rules evolved via genetic programming — Amidos2006 · 2026-09-09
- Light REACT trains robots to adapt on the fly to hardware damage — chris_j_paxton · 2026-09-09
- One global function cuts Sokoban evolution iterations from ~98 to 7-24, finds LLM level-gen study — Amidos2006 · 2026-09-09
- LLM-evolved game levels: one global function takes Zelda playability from ~0% to ~100% — Amidos2006 · 2026-09-09