Debate: Is Maximizing a Simple Goal Really Easier Than a Complex One?
Algon_33 · x · 2026-09-18
@Algon33 presses jessicata on the orthogonality thesis: if rational action over time is a hard optimization/constraint-satisfaction problem, it's not obvious that rationally maximizing a simple goal (paperclips) is easier than maximizing a complex but computationally tractable one — a direct challenge to the classic "simple goals are more dangerous" framing.
Related event: Debate Erupts Over the Orthogonality Thesis in AI Safety(8 posts)→
More from AGI Musings
- Alpha School investigation: 17 campuses on probation, Bill Ackman as shadow lead, Holmes involved — benjaminjriley · 2026-11-02
- Google's chief economist: AI will transform more jobs than it kills — gains come from redesigning workflows — danielrock · 2026-11-02
- Daniel Lemire: AI is exploding demand for boring compute, server CPUs to double — lemire · 2026-11-02
- Alignment researcher: the word "aligned" implies consistencies that don't exist — davidmanheim · 2026-11-02
- By 2035, Indian Parents Will Ask How Many Agents You Manage, Not Your Salary — theteknosaur · 2026-11-02
- Under 5% of US consumers pay for AI, yet compute demand is already forcing usage cuts — NinaDSchick · 2026-11-02