Orthogonality Thesis Debate: Compute Bounds vs Intelligence-Goal Independence
jessi_cata · x · 2026-09-18
An X debate on the classic AI-safety orthogonality thesis: jessicata pushes back on the claim that it holds "true in practice," arguing the thesis is a strong claim about the relationship between goals and intelligence and that you can't assume unbounded intelligence—compute bounds are intrinsic. The thread debates whether rationally maximizing a simple goal (paperclips) is really easier than maximizing a complex but computationally tractable one, framing intelligence as hard optimization/constraint satisfaction.
Related event: Debate Erupts Over the Orthogonality Thesis in AI Safety(8 posts)→
More from AGI Musings
- Databases to distributed systems: every systems skill is merging into AI inference and hardware — Abhishekcur · 2026-11-02
- Limitless analogy: smarter people may gain far more from superintelligence — McDonaghMatthew · 2026-11-02
- Hunting for the most concrete "curing cancer with AI" roadmap of 2025 — iskander · 2026-11-02
- Avoiding AI brain rot: Miles Cranmer's lecture on learning with AI — _ScottCondron · 2026-11-02
- Yacine mocks "autonomous research" hype as Naam argues RSI loop needs 5-10x boost to run away — yacineMTB · 2026-11-02
- Vitalik's "post-AI cryptography": pseudonyms are dead, per-action anonymity is in — devanshmehta · 2026-11-02