关于「原典考辨:朱熹「循序渐进、熟读精思」的读书法与培根《论读书》的「浅尝、吞咽与咀嚼」」,《专著改编的信息保留代数》给出的定量结论是什么?

结论:第七章考辨朱熹「循序渐进、熟读精思」与培根《论读书》,在 5040 种呈现顺序中只有 7 种遵守依赖关系,每篇约 8 遍的精读得到最多能复述的篇目 2.3396。

数据口径:书中参数为示意;全部计算由书中程序生成;本书不是法律意见,也不是个人化的经营或投资建议。 第六章在 40 个制作工时下求出播客、投影片与题库的最优组合,价值 2.0685,不做题库只有 1.4164;事实核对应放在上游;每周 2 次提醒使期望学习次数最高,为 6.2792,过量提醒有害,对脆弱学习者阈值更低;只改编有权改编的书,合成内容必须标识。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 5040

orders of 7 concepts5040
orders that respect every prerequisite7 (share 0.0014)
mean concepts understood, any order3.8340
worst order3.0000
prerequisite order5.6333
prerequisite order with one re-read6.8828
expected re-reads per seven concepts0.7630
查看完整验算程序
# Chapter 7. p71: Zhu Xi's "follow the order", counted over all orders.
# Seven concepts of a monograph form a prerequisite graph:
#   0 -> 1, 0 -> 2, 1 -> 3, 2 -> 3, 3 -> 4, 1 -> 5, 4 -> 6, 5 -> 6.
# A concept is understood with probability 0.9 if every prerequisite was
# met earlier and understood, otherwise 0.35. All 7! orders of
# presentation are enumerated, and for each the exact distribution over
# understood sets is carried forward. A gated reader also re-reads a
# concept once when it is not understood (as Zhu Xi advised: do not seek
# the later before the earlier is grasped). Probabilities illustrative.
import itertools
import math

PRE = {0: (), 1: (0,), 2: (0,), 3: (1, 2), 4: (3,), 5: (1,), 6: (4, 5)}
GOOD, BAD = 0.9, 0.35


def expected(order, gated=False):
    dist = {frozenset(): 1.0}
    rereads = []
    for c in order:
        new = {}
        for got, p in dist.items():
            q = GOOD if all(x in got for x in PRE[c]) else BAD
            if gated:
                rereads.append(p * (1.0 - q))
                q = 1.0 - (1.0 - q) ** 2
            for key, w in ((got | {c}, p * q), (got, p * (1.0 - q))):
                new[key] = math.fsum((new.get(key, 0.0), w))
        dist = new
    mean = math.fsum(p * len(s) for s, p in dist.items())
    return mean, math.fsum(rereads)


def valid(order):
    pos = {c: i for i, c in enumerate(order)}
    return all(pos[a] < pos[c] for c in PRE for a in PRE[c])


orders = list(itertools.permutations(range(7)))
good = [o for o in orders if valid(o)]
all_mean = [expected(o)[0] for o in orders]
good_mean = [expected(o)[0] for o in good]
print("orders of 7 concepts: {}".format(len(orders)))
print("orders that respect every prerequisite: {} (share {:.4f})".format(
    len(good), len(good) / len(orders)))
print("mean concepts understood, any order: {:.4f}".format(
    math.fsum(all_mean) / len(all_mean)))
print("worst order: {:.4f}".format(min(all_mean)))
print("prerequisite order: {:.4f}".format(good_mean[0]))
g, r = expected(good[0], gated=True)
print("prerequisite order with one re-read: {:.4f}".format(g))
print("expected re-reads per seven concepts: {:.4f}".format(r))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《一书多吃内容裂变代数:从硬核专著自动编译双人播客、导学投影片与通关题库》第 7 章「原典考辨:朱熹「循序渐进、熟读精思」的读书法与培根《论读书》的「浅尝、吞咽与咀嚼」」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-151 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026151,
  author    = {Fan, Yafu},
  title     = {Content Fission Algebra: Compiling Hard-Core Monographs into Two-Host Podcasts, Study Slides and Quiz Banks},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论