关于「苏轼、《系辞》、庞加莱与沃拉斯」,《结构洞、函子迁移与灵感共振》给出的定量结论是什么?
结论:创造的四个有名称的阶段属于沃拉斯,而不属于庞加莱;庞加莱自己的论点,即几乎所有组合都是不育的,可以用计数证实:1000 个想法有 166,167,000 个三元组。苏轼的「厚积而薄发」是一个筛选比例:从笔记中发表最好的十分之一,无论笔记多大,都得到约 1.75 个标准差。
数据口径:书中的网络、领域、评分与势阱均为示意模型;全部计算由书中程序生成;本书不是投资、医疗或心理建议。 第六章用模拟检验克莱默斯公式(相差不超过 1.32 倍),并发现噪声太少是主要风险:低噪声下只有 0.017 的运行找到更好的状态,而先孵化后专注的节奏(0.730)并不比稳定的中等噪声(0.750)更好。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1000, 166167000
| ideas | pairs | years | triples | years |
|---|---|---|---|---|
| 100 | 4950 | 0.04 | 161700 | 1.3 |
| 1000 | 499500 | 4.16 | 166167000 | 1384.7 |
| 10000 | 49995000 | 416.62 | 166616670000 | 1388472.2 |
| one working year judges 120000 combinations |
查看完整验算程序
# Chapter 7. p13: Poincare's sterile combinations. With n ideas in mind,
# there are n(n-1)/2 pairs and n(n-1)(n-2)/6 triples. If one combination
# could be judged per minute, eight hours a day, how many working years
# would a full search take? Poincare's point: almost all combinations are
# sterile, so the useful ones must be preselected before they are judged.
from math import comb
MIN_PER_YEAR = 60 * 8 * 250
if __name__ == "__main__":
print(" ideas pairs years triples years")
for n in (100, 1000, 10000):
p, t = comb(n, 2), comb(n, 3)
print(" {:5d} {:11d} {:9.2f} {:15d} {:12.1f}".format(
n, p, p / MIN_PER_YEAR, t, t / MIN_PER_YEAR))
print(" one working year judges {} combinations".format(MIN_PER_YEAR))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《跨学科结构洞桥接、函子知识迁移与灵感随机共振》第 7 章「苏轼、《系辞》、庞加莱与沃拉斯」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-102 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026102,
author = {Fan, Yafu},
title = {Cross-Disciplinary Structural Holes, Functorial Knowledge Transfer and Inspiration Stochastic Resonance},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}