What does A Convergence Criterion for the Self-Evolving Engine conclude, in numbers, about “Requisite Variety: When the Information Budget of Pruning Covers the Noise of Proposals”?
Answer: 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.
Scope of the numbers: Its parameters are illustrative and contain no production information; all calculations are generated by its programs; it is general business analysis, not business advice. 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.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 56
eps = 0.25, g = 0.5; o = converges, X = grows (80 quarters)
K \ a 8 12 16 20 24 32 40 48
2 o X X X X X X X
3 o o X X X X X X
4 o o o X X X X X
6 o o o o o X X X
8 o o o o o o X X
10 o o o o o o o X
12 o o o o o o o o
simulation agrees with eps*a <= K in 56 of 56 cells
a = 24, K = 6, g = 0.5: noise share sweep
eps inflow N@40 N@80 verdict
0.15 3.6 7.2 7.2 converges
0.20 4.8 9.6 9.6 converges
0.25 6.0 12.0 12.0 converges
0.30 7.2 57.0 105.0 grows
0.40 9.6 151.2 295.2 growsShow the full program
# Chapter 2. p23: sensitivity scan of the convergence boundary.
# Model: the stock N of noise rules (wrong rules still live) obeys
# N[t+1] = N[t] + eps * a - min(K, g * N[t])
# a proposals per quarter, noise share eps, pruning gain g (share of
# the noise stock found per quarter), pruning capacity K (rules that
# can be retired per quarter). Theory: N converges to eps * a / g iff
# eps * a <= K; otherwise it grows by eps * a - K every quarter.
# Grid values are illustrative.
def simulate(a, eps, g, k, quarters):
n, path = 0.0, []
for _ in range(quarters):
n = n + eps * a - min(k, g * n)
path.append(n)
return path
def bounded(path):
return abs(path[-1] - path[-2]) < 1e-6
if __name__ == "__main__":
eps, g = 0.25, 0.5
aa = (8, 12, 16, 20, 24, 32, 40, 48)
ks = (2, 3, 4, 6, 8, 10, 12)
print("eps = {}, g = {}; o = converges, X = grows (80 quarters)"
.format(eps, g))
print(" K \ a " + "".join("{:>4}".format(a) for a in aa))
agree, cells = 0, 0
for k in ks:
row = ""
for a in aa:
ok = bounded(simulate(a, eps, g, k, 80))
row += "{:>4}".format("o" if ok else "X")
agree += int(ok == (eps * a <= k))
cells += 1
print(" {:>4} {}".format(k, row))
print("simulation agrees with eps*a <= K in {} of {} cells".format(
agree, cells))
print("a = 24, K = 6, g = 0.5: noise share sweep")
print(" eps inflow N@40 N@80 verdict")
for e in (0.15, 0.20, 0.25, 0.30, 0.40):
p = simulate(24, e, g, 6, 80)
print(" {:.2f} {:>6.1f} {:>5.1f} {:>6.1f} {}".format(
e, e * 24, p[39], p[79],
"converges" if bounded(p) else "grows"))Single source and citation
Fan, Y. (2026). 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 (Version 1.0.0), Chapter 2: Requisite Variety: When the Information Budget of Pruning Covers the Noise of Proposals. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-332 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026332,
author = {Fan, Yafu},
title = {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},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Square Law of Conflict Pairs: n Choose 2, a Fixed Audit Budget and the Backlog
- Chapter 3 · Difference Equations and Stability: Pruning Gain, Audit Delay and Oscillation
- Chapter 4 · The Theorem-Dependency Graph: Kahn's Topological Sort, Cycle Detection and a Synthetic Graph of Three Hundred Volumes
- Chapter 5 · Local Audits and Pruning Gain: How Many Pairs Each New Rule Costs and How Many Conflicts Each Cut Removes
- Chapter 6 · Halting Conditions: the Halting Size and a Curvature Alarm on Conflicts
- Chapter 7 · Eastern and Western Sources: "Generation upon Generation" in the Great Commentary and Wiener's Cybernetics
- Chapter 8 · The Quarterly Convergence Check-up: Procedure, the Engine Convergence Criterion Calculator and a Pre-registered Plan of Refutation