Topological Ordering of the Theorem-Dependency Graph of Three Hundred Volumes and a Convergence Criterion for the Self-Evolving Engine: Halting Conditions between Proposal Noise and Pruning Gain: chapter answers
A five-ring self-evolving engine that keeps proposing projects, writing books and distilling rules is expected to grow wiser as its rules multiply. This book overturns that piece of common sense: the engine does not converge on its own. When proposals outpace pruning, the potential conflict pairs among rules grow with the square of the rule count, reaching 4,498,500 pairs among three thousand rules; under a fixed audit budget, an engine that proposes and never retires sees its unchecked pairs multiply by 4.23 when time doubles. The engine converges only if pruning gain covers proposal noise.…
DOI pending · monograph page goes live after publication · 5DL-B-332 · 中文版
- Chapter 1 · The Square Law of Conflict Pairs: n Choose 2, a Fixed Audit Budget and the Backlog
With $q$ at 0.001, one clash per thousand pairs, the base sounds clean. Yet three hundred rules carry 44.85 expected conflicts and twenty-four hundred rules carry 2878.8. At a hundred rules a base with $q$ of 0.0001 sti… - Chapter 2 · Requisite Variety: When the Information Budget of Pruning Covers the Noise of Proposals
Chapter 2 enumerates Ashby's regulation game exhaustively and writes the convergence condition as noise inflow not exceeding pruning capacity; in a sensitivity scan, simulation and theory agree in 56 of 56 cells. - Chapter 3 · Difference Equations and Stability: Pruning Gain, Audit Delay and Oscillation
Chapter 3 writes difference equations with audit delay: the stable limit of pruning gain is 1.0000 with a one-quarter delay and 0.6180 with two; with too little pruning capacity, conflicts grow 3.78-fold in twenty quart… - Chapter 4 · The Theorem-Dependency Graph: Kahn's Topological Sort, Cycle Detection and a Synthetic Graph of Three Hundred Volumes
Chapter 4 sorts with Kahn's algorithm and finds and repairs cycles with strongly connected components; in a synthetic citation graph of three hundred volumes, 18,828 pairs are comparable, a share of 0.420. - Chapter 5 · Local Audits and Pruning Gain: How Many Pairs Each New Rule Costs and How Many Conflicts Each Cut Removes
Chapter 5 shows that audit scope matters more than audit staff: checking only neighbours in the dependency graph costs about 7.2 checks per new rule against 2949.5 for the whole base, and greedy pruning by conflict coun… - Chapter 6 · Halting Conditions: the Halting Size and a Curvature Alarm on Conflicts
Chapter 6 derives the halting size, 2,000 rules under illustrative parameters, and designs a strict curvature alarm that cuts the naive rule's false-alarm rate of 0.785 to 0.030. - Chapter 7 · Eastern and Western Sources: "Generation upon Generation" in the Great Commentary and Wiener's Cybernetics
Chapter 7 examines "generation upon generation is called change" from the Great Commentary on the Book of Changes and Wiener's Cybernetics of 1948. - Chapter 8 · The Quarterly Convergence Check-up: Procedure, the Engine Convergence Criterion Calculator and a Pre-registered Plan of Refutation
Chapter 8 gives the quarterly convergence check-up, the distilled Engine Convergence Criterion Calculator and a pre-registered plan of refutation, in which testing the effect of pruning needs 7,785 audited pairs per arm…
Illustrative model calculation, not a live quote