You Gotta Be Dumb to Live Forever: The Computational Cost of Persistence
Life is a bad computer. In fact, even the most sophisticated self-replicating systems only use a tiny fraction of their theoretical computational capacity. There is a very good reason for this: anything that self-replicates must sacrifice most of its potential computational power in the service of copying itself.
The Busy Beaver Limit (bbl) is the theoretical maximum complexity achievable by a terminating, non-replicating, computational process. Conversely, the Von Neumann Threshold (vnt) represents the minimum complexity required for a system to become self-replicating. Immortality requires accepting catastrophic inefficiency: the smartest systems die and the dumb ones inherit the universe.