The Mathematics of Civilizational Survival Absorbing-Barrier Structure, Super-Exponential Self-Improvement, and the Irreversibility of Advanced Artificial Intelligence Risk
Abstract
Abstract We develop a formal framework for classifying civilization-scale threats by whether they admit a mathematical repair mechanism, and we locate the risk posed by advanced artificial intelligence (AI) within this classification. Two structurally distinct categories of absorbing barrier are defined: weak barriers, whose dynamics contain a strictly positive recovery term, and strong barriers, for which the recovery term is identically zero and the absorbing state is permanent. A reading rule follows: a barrier may be classified as strong only where the recovery term is shown to be identically zero; a recovery term that is positive but outpaced marks a weak barrier whose cost rises without bound, not a strong one. We argue that the conventionally cited existential threats (nuclear conflict, climate change, pandemics, biodiversity loss, asteroid impact) fall into the weak category, whereas advanced AI is the leading candidate for a strong barrier. We then establish three results. First, under super-exponential self-improvement the capability variable has a finite-time singularity, so that governance operating on a linear or exponential timescale is eventually outpaced. Second, combining the Law of Requisite Variety with computational irreducibility yields a conditional uncontrollability theorem. Third, the cumulative survival probability has a positive lower bound if and only if the per-period barrier-contact hazards are summable; under an explicit assumption that non-stationarity and concentration keep the hazard above a positive floor, the sum diverges and cumulative survival decays to zero. We state precisely the escape conditions under which survival retains a positive lower bound, including their channel-by-channel form. The analysis is presented as a set of conditional theorems; policy implications are discussed but not asserted.
// Source
Authors: Qinfu Li