Frank Qualifies Bounded-Intelligence Claim: Universal TMs Have Finite Active Params, Just Slow
MikePFrank · x · 2026-10-10
Mike Frank qualifies his earlier claim: the answer depends on how you define "active" and "intelligence". A Turing machine has finitely many active parameters (the head and current tape cell), yet a universal TM can perform any computation — just slowly due to its serial nature. So intelligence per active parameter is unbounded if you don't care about speed; but the foom debate is precisely about speed, so his conclusion stands: any explosion is throttled by feasible physical growth rates.
Related event: Debate Erupts Over Whether Intelligence Per Active Parameter Is Bounded(3 posts)→
More from AGI Musings
- NYU math professor says OpenAI's dump of 722 AI papers 'destroyed' early-career mathematicians — HankYeomans · 2026-10-10
- Biologists lay out 3 reasons why AI isn't conscious (yet) — skdh · 2026-10-10
- 'Thriving' isn't harmony but the hurling forth of new minds, argues AI ethicist — danfaggella · 2026-10-10
- Neurons in human claustrum track uncertainty and prediction errors, study finds — VoidStateKate · 2026-10-10
- A 2 AM Question to a Tireless AI Isn't Wisdom — Sometimes It's Just Loneliness That Learned to Speak Well — YogeshMalik · 2026-10-10
- Blogger argues superintelligence is impossible: knowledge requires real-world experiments, SI is just fast AI — JHochderffer · 2026-10-10