Complexity researcher rrwilliams lays out three bets on P vs NP
rrwilliams · x · 2026-11-23
rrwilliams, citing his good track record this year on complexity claims, says he's ready to post his three possible outcomes for P vs NP — the setup for two follow-up posts analyzing the P=NP and P≠NP scenarios.
Related event: Ryan Williams lays out three scenarios for P vs NP(4 posts)→
More from Research
- 25 Ways to Make VLA Robots Faster, Mapped From Model to Server — TheTuringPost · 2026-11-23
- A website shows a coordinated AI agent fleet attacking P vs NP live — kimmonismus · 2026-11-23
- AI finds formal flaws in top economics papers, echoing long-standing critiques — elonmusk · 2026-11-23
- Formalizing CFSG at 3x RH scale: Lean is now the bottleneck for AI math — Vjeux · 2026-11-23
- Aurora2-400M-A20M-QAT: a 0.5-bit MoE checkpoint shrunk from 799 MB to 27.5 MB — Tall_Abrocoma_3533 · 2026-11-23
- Aurora2-400M-A20M-SFT: chat fine-tune of a sparse MoE with only 19M active parameters — Tall_Abrocoma_3533 · 2026-11-23