What does Beyond Distillation conclude, in numbers, about “The Objection Tree: Coverage, Depth and the Order of Repairs”?

Answer: With budgets of 2, 4 and 6 hours, greedy and optimum agree exactly, and coverage rises through 0.7300, 0.7725 and 0.8325. With 8 hours, greedy reaches 0.8725 and the optimum 0.8775, a ratio of 0.9943. The difference lies in the choice. Greedy picks free alternative, reviews and no time; the optimum picks free alternative, reviews and instalments. Greedy takes a small, cheap gap early, and the remaining hours can then no longer fit the larger combination. At 10 and 12 hours the ratios are 0.9973 and 0.9948. At 14 hours every gap is closed and coverage reaches 1.0000.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is general business analysis, not investment, legal or medical advice, and the code it generates is teaching material deployed to no site.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.7300, 0.7725, 0.8325, 0.8725, 0.8775, 0.9943

hoursgreedy covoptimum covgreedy/optimum
20.73000.73001.0000
40.77250.77251.0000
60.83250.83251.0000
80.87250.87750.9943
100.91500.91750.9973
120.95500.96000.9948
141.00001.00001.0000
8 h greedy : free_alternative, reviews, no_time
8 h optimum: free_alternative, reviews, instalments
objections closed per hour, first 2 h and last 2 h: 12.00 8.00
Show the full program
# Chapter 4. p42: which objection gaps to close first under a time budget.
# The five gaps of p41 each need a writing task with a cost in hours
# (illustrative) and close a count of logged objections out of 400.
# Greedy by gain per hour (a heap) is compared with the exact optimum
# found by trying every subset. Starting weighted coverage is 0.67.
import heapq
import itertools
import math

BASE = 268
LOG = 400
TASKS = [
    ("free_alternative", 3, 41),
    ("not_for_me", 4, 33),
    ("reviews", 2, 24),
    ("instalments", 3, 18),
    ("no_time", 2, 16),
]


def greedy(budget):
    heap = [(-g / c, name, c, g) for name, c, g in TASKS]
    heapq.heapify(heap)
    used, gain, picked = 0, 0, []
    while heap:
        _, name, c, g = heapq.heappop(heap)
        if used + c <= budget:
            used += c
            gain += g
            picked.append(name)
    return gain, picked


def best(budget):
    top, pick = 0, ()
    for k in range(len(TASKS) + 1):
        for sub in itertools.combinations(TASKS, k):
            c = math.fsum(t[1] for t in sub)
            g = int(math.fsum(t[2] for t in sub))
            if c <= budget and g > top:
                top, pick = g, tuple(t[0] for t in sub)
    return top, pick


if __name__ == "__main__":
    print("hours  greedy cov  optimum cov  greedy/optimum")
    for b in (2, 4, 6, 8, 10, 12, 14):
        g, _ = greedy(b)
        o, _ = best(b)
        print("{:>5}  {:>10.4f}  {:>11.4f}  {:>14.4f}".format(
            b, (BASE + g) / LOG, (BASE + o) / LOG,
            (BASE + g) / (BASE + o)))
    g, gp = greedy(8)
    o, op = best(8)
    print("8 h greedy : " + ", ".join(gp))
    print("8 h optimum: " + ", ".join(op))
    print("objections closed per hour, first 2 h and last 2 h: {:.2f} {:.2f}"
          .format(
        (best(2)[0]) / 2.0, (best(14)[0] - best(12)[0]) / 2.0))

Single source and citation

Fan, Y. (2026). Beyond Distillation: Executable Business-Organ Synthesis, Generative Code Crystallisation and Living-System Bootstrapping (Version 1.0.0), Chapter 4: The Objection Tree: Coverage, Depth and the Order of Repairs. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-378 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026378,
  author    = {Fan, Yafu},
  title     = {Beyond Distillation: Executable Business-Organ Synthesis, Generative Code Crystallisation and Living-System Bootstrapping},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book