Kolmogorov complexity, AIXI and undecidability: why intelligence lives in problems compute can't swallow
JensHonack · x · 2026-11-18
A theoretical thread connecting Kolmogorov complexity (intelligence via the AIXI framework), MDL (complex structures via epiplexity), and the Second Recursion Theorem (self-referential, self-replicating programs via functional equivalence). The author argues their shared incomputability and undecidability is no coincidence: intelligence and consciousness inevitably reflect undecidable problems, and only by confronting them can life pour in infinite compute. Scaling laws, he suggests, should be read this way — invest compute in problems compute itself can never swallow.
More from AGI Musings
- Figure CEO Bret Adcock: humanoid race has four stages, Figure is now in stage three with Helix 3 as 'baby AGI' — PeterDiamandis · 2026-11-18
- 'This is how recruiters, job-seekers and hiring managers work now too' — adam_dorr · 2026-11-18
- Former SEC Chair Gary Gensler says the AI bubble will likely burst and cause a recession before 2028 — SumitGup · 2026-11-18
- AGI hype is driven by grift and attention, argues Reddit skeptic — Present-Chocolate-24 · 2026-11-18
- AI Interviewers Are Turning Hiring Into an Enterprise AI Failure, Analyst Warns — DavidLinthicum · 2026-11-18
- BAIO101: An illustrated guide of 101 AI x bio concepts, from protein design to virtual cells — DrMorganLevine · 2026-11-18