Casado cites Nash equilibrium complexity to argue defensibility is pointless
DimitrisPapail · x · 2026-11-04
Martin Casado continues his campaign that discussions of AI defensibility are pointless, citing the classic result that Nash equilibria cannot be efficiently computed. Dimitris Papail quips he'd now bet less on P!=PPAD than 18 days ago, implying recent progress is brushing against these complexity assumptions.
More from AGI Musings
- Looking back at vibe-coded projects from 6-8 months ago, most are already obsolete — DeryaTR_ · 2026-11-04
- 'AI 2027' Resurfaces: Automation of Top Research Teams by Early 2027? — cephaloform · 2026-11-04
- Deutsch critic: his strongest adherents kept missing AI progress for 4 years — NathanpmYoung · 2026-11-04
- A proposal for "Partially-Selfish Nonprofits" that let founders keep 1% of donations — AaronBergman18 · 2026-11-04
- Weight-Space Programming backlash: why do amplified hype influencers escape blame? — xeophon · 2026-11-04
- Don't Tie Your Identity to Your Job Title—AI Will Reshape It Within Years — KevinNaughtonJr · 2026-11-04