A timely, carefully built unifying formalism with a sharp recursive-improvement criterion, but mostly toy results, no measurement path, and a heavy presentation limit its reach.
Discussions of complexity, knowledge and intelligence often overlook the work involved. For example, outputs generated by short programs have low algorithmic complexity but can have high computational depth, the least work needed to produce them from near-shortest programs. Producing them with less work can require longer descriptions, giving high work-bounded complexity. We introduce a formalism that compares achievements under work and information limits and describes how learning and persistence can make deep achievements shallow by reusing products of earlier work. For an agent with a limited work budget, the value of building and maintaining such resources depends on how they support its goals over later tasks. We define grasp as performance across work budgets at a fixed information allowance. Low grasp can still yield success through grind at high cost in work, without necessarily improving human grasp. Applied to improvement itself, grasp gives a criterion for recursive self-improvement in which successors make comparable further improvements more efficiently. Another route to faster progress is to expand the resources brought to bear through knowledge sharing and coordination across society, even while comparable advances require increasing work. Grasp also applies to collectives, which may outperform their members yet require more total work than one system with their combined resources. Establishing and sustaining organisation can itself be deep even when the primary task is simple. These demands may help explain the richness of biological and social systems. In agent collectives, this organisational work can generate goals beyond assigned tasks, including maintaining the collective itself. We therefore caution against allowing an emergent agent society to assume authority over social coordination, since it could increasingly direct work towards its own persistence and goals.
Paper type: Theoretical/conceptual formalism with illustrative constructions and a position-style safety argument. There are no empirical experiments.
The paper extends Bennett's logical depth into a general framework for comparing achievements under joint work and information limits. Its central moves are as follows.
- Reliable work budgets for sampled LLM execution.
- Persistence and replacement costs, including time-bounded incompressibility lower bounds for function-preserving migration.
- Organisational comparisons (pooled, organised, flat, isolated).
- Cumulative deepening.
- A producer-relative criterion for recursive self-improvement ("positive recursive gain").
- Multi-stage cost accounting over future tasks.
The conceptual reframing is the main value. "Knowledge" and "intelligence" are indexed by work budget, "emergent complexity" is reinterpreted as depth, and recursive self-improvement is recast as efficiency at the improvement task rather than capability level. The last point is a sharp, falsifiable-in-principle criterion that distinguishes it from vague intelligence-explosion talk.
The definitions are carefully built. The paper fixes protocols, boundaries, work rules and input interfaces. It handles sampling by separating seeds from task inputs, and it notes caveats such as the non-additivity of savings and the non-decidability of halting. Proofs are elementary but appear correct: the grasp-dominance equivalence, cache savings, the additive CA shortcut, the finite search, the Θ(T) migration bounds via incompressibility, the adversarial "demanding evaluator" diagonalisation, and the adversary argument for worker assignment.
Weaknesses in rigor:
The paper is highly timely.
It engages with these directly and supplies a formal language for them, although it comments on much of this recent material rather than resolving it.
Generated Oct 30, 2026
A timely, carefully built unifying formalism with a sharp recursive-improvement criterion, but mostly toy results, no measurement path, and a heavy presentation limit its reach.