{ "personId": "turing", "uid": "SL-0006", "name": "艾伦·图灵", "version": "V2研究贡献账", "updatedAt": "2026-09-15", "displayScore": "6.94", "exactScore": "6.938529520942012742262214887600058851702355007463645080265359572336446463874912192305218197059496182", "totalLight": "2945.217199", "exactTotalLight": "2945.217199168147414260679541345936222579495222575277970182750716529644571109068266757401005945646991", "scopeNote": "本轮当前已列19项有限研究账；M与归功份额为可修订判断。未覆盖内容和未核清的负面作用不按零处理，具体缺口见逐项说明。", "formula": { "q": "Q = 10^(M/2) − 1", "light": "Lᵢ = aᵢ × Qᵢ", "total": "L = Σ Lᵢ", "score": "S = 2 × log₁₀(1 + L)" }, "items": [ { "id": "OUT-SL0006-1952-MATHEMATICAL-PATTERN-FORMATION", "title": "形态发生的数学理论", "year": "1952", "mReason": "反应—扩散模型给出从均匀状态产生空间图样的可分析机制，成为跨学科可复用理论工具；不以具体生物现象、实验确认或后来的全部模式形成理论加分。", "sources": [ { "label": "Turing, The Chemical Basis of Morphogenesis", "url": "https://doi.org/10.1098/rstb.1952.0012" } ], "aReason": "图灵构造反应—扩散不稳定性理论；Waddington、Michaelis—Menten、Jeans 等明确的生物与化学输入保留，未将实验支持或后继应用化为个人份额。", "M": "6.0", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.82" }, { "actor": "C. H. Waddington", "actorId": "EXT-LITERAL:C. H. Waddington", "type": "PERSON", "share": "0.04" }, { "actor": "L. Michaelis", "actorId": "EXT-LITERAL:L. Michaelis", "type": "PERSON", "share": "0.02" }, { "actor": "M. L. Menten", "actorId": "EXT-LITERAL:M. L. Menten", "type": "PERSON", "share": "0.02" }, { "actor": "J. H. Jeans", "actorId": "EXT-LITERAL:J. H. Jeans", "type": "PERSON", "share": "0.03" }, { "actor": "未分配", "actorId": "TUR-NET-MORPH1952::UNALLOCATED::5", "type": "UNALLOCATED", "share": "0.07" } ], "share": "0.82", "exactLight": "819.18", "light": "819.180000", "standaloneScore": "5.83", "lightSharePercent": "27.8139" }, { "id": "OUT-SL0006-COMPUTABILITY-UNIVERSAL-MACHINE-DECISION-LIMIT", "title": "可计算性的机器表示与通用模拟", "year": "1936", "summary": "", "M": "6", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.68" }, { "actor": "阿隆佐·邱奇", "actorId": "SL-0242", "type": "PERSON", "share": "0.04" }, { "actor": "希尔伯特、阿克曼、哥德尔等逻辑前驱", "actorId": "TURING-1936-COMPUTABILITY-UNIVERSAL-MACHINE-DECISION-LIMIT::HILBERT_ACKERMANN_GODEL_AND_LOGICAL_FOUNDATIONS_PREDECESSORS", "type": "PREDECESSOR", "share": "0.09" }, { "actor": "马克斯·纽曼", "actorId": "SL-1811", "type": "PERSON", "share": "0.06" }, { "actor": "人工计算、电传与有限符号操作实践", "actorId": "TURING-1936-COMPUTABILITY-UNIVERSAL-MACHINE-DECISION-LIMIT::HUMAN_CALCULATOR_TELEPRINTER_AND_FINITE_SYMBOLIC_PROCEDURE_INPUTS", "type": "PREDECESSOR", "share": "0.04" }, { "actor": "学术呈现及期刊发表支持", "actorId": "TURING-1936-COMPUTABILITY-UNIVERSAL-MACHINE-DECISION-LIMIT::CONTEMPORARY_ACADEMIC_PRESENTATION_AND_JOURNAL_PUBLICATION_SUPPORT", "type": "INSTITUTION", "share": "0.04" }, { "actor": "未分配", "actorId": "TURING-1936-COMPUTABILITY-UNIVERSAL-MACHINE-DECISION-LIMIT::UNKNOWN_RESIDUAL_TURING_1936_COMPUTABILITY", "type": "UNALLOCATED", "share": "0.05" } ], "mReason": "以机器形式表示有限符号过程并构造通用模拟，提供可复用的计算方法；界限论证作为该方法的验证，不重复计入共同不可判定结论。", "aReason": "邱奇在此成果中的归功份额为4.00%。图灵的机器构造占68%；邱奇的λ方法关系输入占4%；逻辑前驱9%、马克斯·纽曼6%、人工计算与符号操作实践4%、学术发表支持4%、未分配5%。归功比例为可修订的研究判断。", "overlapNote": "与邱奇的λ转换方法分别计入独立方法交付；共同判定结论和两种形式的等价关系不再另列第三项全额贡献。", "status": "已纳入研究估分", "missing": "沿用既有来源和有限主要族评估；未穷尽持续使用、独立替代路径和前驱贡献证据。本次修订并未重新全文核读所有原作。", "sources": [ { "label": "Turing Archive, On Computable Numbers", "url": "https://turingarchive.kings.cam.ac.uk/publications-lectures-and-talks-amtb/amt-b-12" } ], "share": "0.68", "exactLight": "679.32", "light": "679.320000", "standaloneScore": "5.67", "lightSharePercent": "23.0652" }, { "id": "OUT-SL0006-1939-ORDINAL-LOGICS-ORACLE-FRAMEWORK", "title": "序数逻辑与神谕框架", "year": "1939", "summary": "", "M": "5.4", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.8200" }, { "actor": "阿隆佐·邱奇", "actorId": "SL-0242", "type": "PREDECESSOR", "share": "0.1000" }, { "actor": "斯蒂芬·克莱尼", "actorId": "SL-1823", "type": "PREDECESSOR", "share": "0.0500" }, { "actor": "未分配", "actorId": "ORDINAL1939::UNALLOCATED", "type": "UNALLOCATED", "share": "0.0300" } ], "mReason": "序数进展与神谕机把形式系统的可证明性边界转为可扩展框架，形成重要的基础逻辑能力；不把后来的递归论全体成果计入。", "aReason": "邱奇在此成果中的归功份额为10.0000%。图灵给出序数逻辑与神谕框架的核心构造；Church 与 Kleene 的可计算性和递归论输入被明确保留。", "overlapNote": "", "status": "已纳入研究估分", "missing": "沿用既有来源和有限主要族评估；未穷尽持续使用、独立替代路径和前驱贡献证据。本次修订并未重新全文核读所有原作。", "sources": [ { "label": "图灵档案：Systems of logic based on ordinals（AMT-B-15）", "url": "https://turingarchive.kings.cam.ac.uk/publications-lectures-and-talks-amtb/amt-b-15" } ], "share": "0.8200", "exactLight": "410.1535315743632737012744332456555298095870316629117964223519138289892296648411649470118424294764978", "light": "410.153532", "standaloneScore": "5.23", "lightSharePercent": "13.9261" }, { "id": "OUT-SL0006-1946-ACE-REPORT-ARCHITECTURE", "title": "ACE 报告的计算机体系结构", "year": "1946", "mReason": "一份具体的存储程序机器设计把运算、存储和控制组织为可实现的架构能力；不把实际建造、其他机器路线或现代计算产业一并计入。", "sources": [ { "label": "Alan Turing Institute: ACE report", "url": "https://www.turing.org.uk/scrapbook/ace.html" } ], "aReason": "图灵完成 ACE 的架构设计；von Neumann 的既有存储程序工作与未分配工程输入保留，未由报告作者身份消除。", "M": "5.0", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.82" }, { "actor": "约翰·冯·诺伊曼", "actorId": "SL-0018", "type": "PERSON", "share": "0.13" }, { "actor": "未分配", "actorId": "TUR-NET-ACE1946-DESIGN::UNALLOCATED::2", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.82", "exactLight": "258.4867681338071052239092706434829197650035214246677798023153979289927439684175341502283448871026242", "light": "258.486768", "standaloneScore": "4.83", "lightSharePercent": "8.7765" }, { "id": "OUT-SL0006-1950-IMITATION-GAME-QUESTION-REFRAMING", "title": "模仿游戏对机器智能问题的重述", "year": "1950", "mReason": "把“机器能否思考”改写为可讨论的模仿游戏，并系统回应一组反对意见，形成持久公共与专业方法论议题；它不是机器智能的实证判定或后续人工智能全体能力。", "sources": [ { "label": "Turing, Computing Machinery and Intelligence", "url": "https://academic.oup.com/mind/article/LIX/236/433/986238" } ], "aReason": "图灵完成问题重述与论证结构；既有计算机、心灵哲学与反对意见语境被限定保留，不把公众讨论本身误作独占的技术成果。", "M": "4.7", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.85" }, { "actor": "BOUNDED EXTERNAL COMPUTER AND OBJECTION CONTEXT", "actorId": "POOL:BOUNDED_EXTERNAL_COMPUTER_AND_OBJECTION_CONTEXT", "type": "PREDECESSOR", "share": "0.05" }, { "actor": "ORIGINAL MIND PUBLICATION", "actorId": "POOL:ORIGINAL_MIND_PUBLICATION", "type": "INSTITUTION", "share": "0.02" }, { "actor": "未分配", "actorId": "POOL:UNALLOCATED_W3", "type": "UNALLOCATED", "share": "0.08" } ], "share": "0.85", "exactLight": "189.4412967783088670161708224595880983651172188031232998855550248863210243541312163302330476567288604", "light": "189.441297", "standaloneScore": "4.56", "lightSharePercent": "6.4322" }, { "id": "OUT-SL0006-1948-MATRIX-ROUNDING-ANALYSIS", "title": "矩阵过程的舍入误差分析", "year": "1948", "mReason": "它公开处理线性方程、求逆、三角分解与消元重排中的共同数值误差，覆盖一类核心计算任务而高于局部技巧；但缺乏独立扩散证据，且误差假设和失败情形限制它不到国际方法档。", "sources": [ { "label": "Turing, Rounding-off errors in matrix processes", "url": "https://doi.org/10.1093/qjmam/1.1.287" } ], "aReason": "图灵分析特定条件下的舍入误差并给出 LDU 条件性结论；Gauss/Cholesky 消元、Hotelling—von Neumann—Goldstine 语境及 Fox 等实践仍为具体前提。", "M": "4.5", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.7" }, { "actor": "EXISTING GAUSS CHOLESKI ELIMINATION", "actorId": "MATRIX1948::EXISTING_GAUSS_CHOLESKI_ELIMINATION", "type": "PREDECESSOR", "share": "0.08" }, { "actor": "HOTELLING VON NEUMANN GOLDSTINE CONTEXT", "actorId": "MATRIX1948::HOTELLING_VON_NEUMANN_GOLDSTINE_CONTEXT", "type": "PREDECESSOR", "share": "0.07" }, { "actor": "FOX GOODWIN WILKINSON PRACTICE", "actorId": "MATRIX1948::FOX_GOODWIN_WILKINSON_PRACTICE", "type": "TEAM", "share": "0.1" }, { "actor": "未分配", "actorId": "MATRIX1948::UNALLOCATED", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.7", "exactLight": "123.7795587027245960857794836634879391315053368481578750608281505943411317077645663430210279495091508", "light": "123.779559", "standaloneScore": "4.19", "lightSharePercent": "4.2027" }, { "id": "OUT-SL0006-1949-PROGRAM-ASSERTIONS-TERMINATION-METHOD", "title": "程序断言与终止性检查方法", "year": "1949", "mReason": "把程序正确性问题表述为断言与终止性检查的可传授方法，形成专门但可移植的编程知识；不含所有程序验证或现代形式化方法。", "sources": [ { "label": "Turing Archive", "url": "https://turingarchive.kings.cam.ac.uk/" } ], "aReason": "图灵发表具体检查步骤和论证；逻辑/编程语境与会议发表支持被保留，未以单人署名吞并整个验证传统。", "M": "3.7", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.85" }, { "actor": "LOGICAL AND PROGRAMMING CONTEXT", "actorId": "CHECK1949::LOGICAL_AND_PROGRAMMING_CONTEXT", "type": "PREDECESSOR", "share": "0.05" }, { "actor": "CONFERENCE AND PRESENTATION SUPPORT", "actorId": "CHECK1949::CONFERENCE_AND_PRESENTATION_SUPPORT", "type": "INSTITUTION", "share": "0.05" }, { "actor": "未分配", "actorId": "CHECK1949::UNALLOCATED", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.85", "exactLight": "59.32539167265172241818827008609158029512680207186038791280853494313916860675165301997449532950899874", "light": "59.325392", "standaloneScore": "3.56", "lightSharePercent": "2.0143" }, { "id": "OUT-SL0006-1953-ZERO-COUNT-COMPLETENESS-METHOD", "title": "zeta 零点计数的完备性方法", "year": "1953", "mReason": "零点计数与已计算零点的完备性检验提供专业解析数论能力；不把黎曼猜想、完整零点分布或后来的大规模计算纳入。", "sources": [ { "label": "Turing, Some calculations of the Riemann zeta-function", "url": "https://doi.org/10.1096/rspa.1953.0036" } ], "aReason": "图灵提出计数和完备性检验方法；Littlewood、Riemann—Titchmarsh 与既有零点计算保留为具体前提。", "M": "3.8", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.75" }, { "actor": "LITTLEWOOD", "actorId": "ZETA1953::LITTLEWOOD", "type": "PREDECESSOR", "share": "0.10" }, { "actor": "RIEMANN TITCHMARSH AND PRIOR ZERO COMPUTATION", "actorId": "ZETA1953::RIEMANN_TITCHMARSH_AND_PRIOR_ZERO_COMPUTATION", "type": "PREDECESSOR", "share": "0.08" }, { "actor": "PUBLICATION", "actorId": "ZETA1953::PUBLICATION", "type": "INSTITUTION", "share": "0.02" }, { "actor": "未分配", "actorId": "ZETA1953::UNALLOCATED", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.75", "exactLight": "58.82461760432111265494387121272909494417204738166132490692429469877167728936156531228214388853927086", "light": "58.824618", "standaloneScore": "3.55", "lightSharePercent": "1.9973" }, { "id": "OUT-SL0006-1938-CONNECTED-LIE-FINITE-APPROXIMATION", "title": "连通 Lie 群的有限近似证明", "year": "1937–1938", "mReason": "连通 Lie 群范围内的有限近似结论是可复用的专业群论方法；原命题不能无条件扩至非连通群，因而不作更广的学科基础主张。", "sources": [ { "label": "图灵档案：Finite approximations to Lie groups（AMT-B-13）", "url": "https://turingarchive.kings.cam.ac.uk/publications-lectures-and-talks-amtb/amt-b-13" } ], "aReason": "图灵完成受连通条件限制的证明；Jordan 与 von Neumann 的前驱工具及出版支持保留，有限群反例不被忽略。", "M": "3.8", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.7" }, { "actor": "卡米耶·若尔当", "actorId": "EXT-LITERAL:Camille Jordan", "type": "PERSON", "share": "0.12" }, { "actor": "约翰·冯·诺伊曼", "actorId": "SL-0018", "type": "PERSON", "share": "0.1" }, { "actor": "LIE PUBLICATION SUPPORT", "actorId": "LIE_PUBLICATION_SUPPORT", "type": "TEAM", "share": "0.03" }, { "actor": "未分配", "actorId": "LIE_UNRESOLVED", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.7", "exactLight": "54.90297643069970514461427979854715528122724422288390324646267505218689880340412762479666762930331947", "light": "54.902976", "standaloneScore": "3.49", "lightSharePercent": "1.8641" }, { "id": "OUT-SL0006-1948-UNORGANISED-MACHINE-TECHNICAL-PROPOSAL", "title": "无组织机器的技术方案", "year": "1948", "mReason": "提出可训练、可组织机器的明确技术模型，超过纯设想；但未证实建造、部署或稳定性能，故只作为有限专业方案。", "sources": [ { "label": "Turing Archive", "url": "https://turingarchive.kings.cam.ac.uk/" } ], "aReason": "图灵给出无组织机器的模型与训练设想；未分配的技术实现和前史输入仍保留，不能把后来的机器学习系统归入。", "M": "3.5", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.85" }, { "actor": "未分配", "actorId": "TUR-NET-IM1948::UNALLOCATED::1", "type": "UNALLOCATED", "share": "0.05" }, { "actor": "未分配", "actorId": "TUR-NET-IM1948::UNALLOCATED::2", "type": "UNALLOCATED", "share": "0.1" } ], "share": "0.85", "exactLight": "46.94901264117967183357083838100090467480133866338879144694360101755010333466034215699792868472872600", "light": "46.949013", "standaloneScore": "3.36", "lightSharePercent": "1.5941" }, { "id": "OUT-SL0006-1938-NONABELIAN-GROUP-EXTENSION-METHOD", "title": "非阿贝尔群扩张的条件与构造", "year": "1938", "mReason": "明确条件下的扩张判据和构造为专业群论提供一组可操作方法；不等同于一般群论平台或后来的分类理论。", "sources": [ { "label": "Turing Archive", "url": "https://turingarchive.kings.cam.ac.uk/" } ], "aReason": "图灵提出该扩张条件与构造；Baer、Schreier 和 Reidemeister 的先行方法各有保留，不能以单篇署名推成独占。", "M": "3.5", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.70" }, { "actor": "BAER", "actorId": "GROUP1938::BAER", "type": "PREDECESSOR", "share": "0.12" }, { "actor": "SCHREIER", "actorId": "GROUP1938::SCHREIER", "type": "PREDECESSOR", "share": "0.07" }, { "actor": "REIDEMEISTER", "actorId": "GROUP1938::REIDEMEISTER", "type": "PREDECESSOR", "share": "0.06" }, { "actor": "PUBLICATION", "actorId": "GROUP1938::PUBLICATION", "type": "INSTITUTION", "share": "0.02" }, { "actor": "未分配", "actorId": "GROUP1938::UNALLOCATED", "type": "UNALLOCATED", "share": "0.03" } ], "share": "0.70", "exactLight": "38.66389276332443562764657278435368620277757301690841648571825966151184980501439942341005891683542141", "light": "38.663893", "standaloneScore": "3.20", "lightSharePercent": "1.3128" }, { "id": "OUT-SL0006-1935-LEFT-RIGHT-ALMOST-PERIODICITY-EQUIVALENCE", "title": "左右概周期性的等价证明", "year": "1935", "mReason": "一个有限而可复核的等价证明提供专业数学知识，却没有显示跨领域平台或广泛应用，故限于专业方法量级。", "sources": [ { "label": "Turing Archive", "url": "https://turingarchive.kings.cam.ac.uk/" } ], "aReason": "图灵给出两种概周期性定义的等价证明；Bohr 的概周期理论仍保留为前提，未把定义传统转写为图灵独创。", "M": "3.2", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.9" }, { "actor": "约翰·冯·诺伊曼", "actorId": "SL-0018", "type": "PERSON", "share": "0.08" }, { "actor": "未分配", "actorId": "AP1935::UNALLOCATED", "type": "UNALLOCATED", "share": "0.02" } ], "share": "0.9", "exactLight": "34.92964534981475256932270745789768391389093335676424021787557332542023684825122351666164804466396243", "light": "34.929645", "standaloneScore": "3.11", "lightSharePercent": "1.1860" }, { "id": "OUT-TUNNY-TURINGERY-METHOD-AND-EARLY-USE", "title": "Turingery 方法及其早期使用", "year": "1942–1943", "mReason": "公开机构材料确认它是用于 Lorenz/Fish 问题的统计分析方法，并被后续机器思路利用，故超过私人构想；运行、用户、产出和终端情报结果未闭合，不能提升为更高档的实际使用成果。", "sources": [ { "label": "Bletchley Park: Turing and the Lorenz cipher", "url": "https://bletchleypark.org.uk/story/tunny-and-colossus/" } ], "aReason": "图灵提出 Turingery 的统计分析方法；Tutte 研究前史、拦收测试人员、邮政工程、机构资源和未分配输入均保留，Newmanry/Colossus 不归为图灵个人交付。", "M": "4.0", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.35" }, { "actor": "TUTTE RESEARCH SECTION ANTECEDENTS", "actorId": "TURINGERY::TUTTE_RESEARCH_SECTION_ANTECEDENTS", "type": "TEAM", "share": "0.2" }, { "actor": "INTERCEPTION TESTERY OPERATORS ANALYSIS", "actorId": "TURINGERY::INTERCEPTION_TESTERY_OPERATORS_ANALYSIS", "type": "TEAM", "share": "0.25" }, { "actor": "POST OFFICE REPLICA ENGINEERING", "actorId": "TURINGERY::POST_OFFICE_REPLICA_ENGINEERING", "type": "TEAM", "share": "0.1" }, { "actor": "BP INSTITUTIONAL RESOURCES", "actorId": "TURINGERY::BP_INSTITUTIONAL_RESOURCES", "type": "INSTITUTION", "share": "0.05" }, { "actor": "未分配", "actorId": "TURINGERY::UNALLOCATED", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.35", "exactLight": "34.65", "light": "34.650000", "standaloneScore": "3.10", "lightSharePercent": "1.1765" }, { "id": "OUT-SL0017-1956-STATE-SYMBOL-UNIVERSAL-SIMULATION", "title": "状态与符号限制下的万能计算模拟", "year": "1956", "summary": "", "M": "4.5", "budget": [ { "actor": "克劳德·香农", "actorId": "SL-0017", "type": "PERSON", "share": "0.72" }, { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.20" }, { "actor": "未分配形成责任", "actorId": "OUT-SL0017-1956-STATE-SYMBOL-UNIVERSAL-SIMULATION::UNALLOCATED_COMMON_SCALE_20260915", "type": "UNALLOCATED", "share": "0.08" } ], "mReason": "两种独立模拟构造共同交付状态／符号权衡的模型不变性；较局部锐界更直接改变计算模型的通用描述，但不领取计算机工业功劳。", "aReason": "香农交付状态/符号权衡的两类模拟构造取0.72；图灵的通用机对象是不可替代的具体前驱输入取0.20，余0.08未分配。", "overlapNote": "只计状态/符号受限下的模拟构造；图灵通用机原成果、后续最小机和计算机工业不重复。", "status": "已纳入研究估分", "missing": "沿用既有来源和有限主要族评估；未穷尽持续使用、独立替代路径和前驱贡献证据。本次修订并未重新全文核读所有原作。", "sources": [ { "label": "《香农论文集》印刷第 733 页起", "url": "https://www.jonglage.net/theorie/notation/siteswap-avancee/refs/books/Claude%20Shannon%20-%20Collected%20Papers.pdf", "note": "作品定位：A universal Turing machine with two internal states。书目只用于定位，具体采信范围与量级/归功判断见本项说明；同篇可含多个不同结果。" }, { "label": "Stanford Encyclopedia of Philosophy: Turing Machines", "url": "https://plato.stanford.edu/entries/turing-machine/", "note": "冻结链已读 §2.5；仅支持模型史定位。" } ], "share": "0.20", "exactLight": "35.36558820077845602450842390385369689471581052804510716023661445552603763078987609800600798557404310", "light": "35.365588", "standaloneScore": "3.12", "lightSharePercent": "1.2008", "changeReason": "M沿用4.5；预算已按aReason修订。精确个人份额由共同budget按actorId读取，单项分由公式生成。" }, { "id": "OUT-SL0006-1943-INTERMEDIATE-ZETA-EVALUATION-METHOD", "title": "zeta 函数的中间范围求值法", "year": "1943–1945", "mReason": "该方法改进特定范围的 zeta 数值求值，具有可复用专业价值；不含黎曼猜想、完整零点计算或后来的算法体系。", "sources": [ { "label": "Turing Archive", "url": "https://turingarchive.kings.cam.ac.uk/" } ], "aReason": "图灵给出中间范围的函数求值步骤；函数方程、积分和既有计算方法保留为输入，未把它们改为个人发现。", "M": "3.2", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.70" }, { "actor": "FUNCTIONAL EQUATION INTEGRAL AND PRIOR COMPUTATION", "actorId": "EARLYZETA::FUNCTIONAL_EQUATION_INTEGRAL_AND_PRIOR_COMPUTATION", "type": "PREDECESSOR", "share": "0.20" }, { "actor": "PUBLICATION", "actorId": "EARLYZETA::PUBLICATION", "type": "INSTITUTION", "share": "0.03" }, { "actor": "未分配", "actorId": "EARLYZETA::UNALLOCATED", "type": "UNALLOCATED", "share": "0.07" } ], "share": "0.70", "exactLight": "27.16750193874480755391766135614264304413739261081663128056989036421573977086206273518128181251641522", "light": "27.167502", "standaloneScore": "2.90", "lightSharePercent": "0.9224" }, { "id": "OUT-TURING-BAYLEY-DELILAH-WORKING-PROTOTYPE", "title": "Turing—Bayley Delilah 可工作原型", "year": "1944–1945", "mReason": "已有编入与恢复的共同工作原型及成功演示，跨过纯方案阶段；关键单元仍待完善、没有部署或跨单位采用，故限于共享原型能力。", "sources": [ { "label": "Bletchley Park: Delilah secure speech system", "url": "https://bletchleypark.org.uk/our-story/delilah/" } ], "aReason": "图灵与 Donald Bayley 共同完成并演示 Delilah 原型；Bell Labs SIGSALY 概念、Hanslope 资源及其他不明输入仍保留，不能按一人主导或扩为部署系统。", "M": "3.5", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.45" }, { "actor": "PERSON DONALD BAYLEY", "actorId": "PERSON-DONALD-BAYLEY", "type": "PERSON", "share": "0.4" }, { "actor": "BELL LABS SIGSALY CONCEPTS", "actorId": "DELILAH::BELL_LABS_SIGSALY_CONCEPTS", "type": "PREDECESSOR", "share": "0.08" }, { "actor": "HANSLOPE RESOURCES", "actorId": "DELILAH::HANSLOPE_RESOURCES", "type": "INSTITUTION", "share": "0.04" }, { "actor": "未分配", "actorId": "DELILAH::UNALLOCATED", "type": "UNALLOCATED", "share": "0.03" } ], "share": "0.45", "exactLight": "24.85535963356570861777279678994165541607129693944112488367602406811476058893782820076360930367991377", "light": "24.855360", "standaloneScore": "2.83", "lightSharePercent": "0.8439" }, { "id": "OUT-BRITISH-BOMBE-ENIGMA-CONNECTED-WORKFLOW", "title": "英国 Bombe—Enigma 连通破译工作流", "year": "1940–1945", "mReason": "一套已接入实际密码分析的有限工作流形成可复用安全能力，但现有范围不量化情报结果、战争总效应或硬件体系的全部价值。", "sources": [ { "label": "英国国家档案馆：Bletchley Park 的工作请求", "url": "https://www.nationalarchives.gov.uk/explore-the-collection/stories/a-dramatic-plea-for-churchills-help/" } ], "aReason": "图灵参与 Banburismus 与 Bombe 相关分析工作；归因同时保留 Welchman、工程制造、波兰—法国前史、拦收和验证人员及机构资源，未按作者人数均分或把 Colossus 归入。", "M": "4.1", "status": "已纳入研究估分", "budget": [ { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": "0.2" }, { "actor": "PERSON GORDON WELCHMAN", "actorId": "PERSON-GORDON-WELCHMAN", "type": "PERSON", "share": "0.12" }, { "actor": "KEEN BTM ENGINEERING MANUFACTURE", "actorId": "BOMBE::KEEN_BTM_ENGINEERING_MANUFACTURE", "type": "TEAM", "share": "0.18" }, { "actor": "POLISH FRENCH PRECURSORS", "actorId": "BOMBE::POLISH_FRENCH_PRECURSORS", "type": "PREDECESSOR", "share": "0.12" }, { "actor": "PERSON DILLY KNOX", "actorId": "PERSON-DILLY-KNOX", "type": "PERSON", "share": "0.04" }, { "actor": "ALEXANDER CLARKE AND HUT8 PAPER ANALYSIS", "actorId": "BOMBE::ALEXANDER_CLARKE_AND_HUT8_PAPER_ANALYSIS", "type": "TEAM", "share": "0.06" }, { "actor": "INTERCEPTION OPERATORS VALIDATION INTERPRETATION", "actorId": "BOMBE::INTERCEPTION_OPERATORS_VALIDATION_INTERPRETATION", "type": "TEAM", "share": "0.18" }, { "actor": "BP INSTITUTIONAL RESOURCES", "actorId": "BOMBE::BP_INSTITUTIONAL_RESOURCES", "type": "INSTITUTION", "share": "0.05" }, { "actor": "未分配", "actorId": "BOMBE::UNALLOCATED", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.2", "exactLight": "22.24036908603926871182077892955811473444617014721105924890148896340206605372448711884644821386380960", "light": "22.240369", "standaloneScore": "2.73", "lightSharePercent": "0.7551" }, { "id": "OUT-SL0018-SELF-REPRODUCING-AUTOMATA-CONSTRUCTION", "title": "自复制自动机的逻辑构造与设计补完", "year": "1940年代末–1966", "summary": "研究抽象自动机如何构造并复制自身，未完成部分由伯克斯整理和补完。", "mReason": "和ACE M5同档：两者都是有界而未完全物理实现的通用计算构造；不借现代人工生命和生物技术把它升到成熟系统档。", "aReason": "John构想/遗稿60%、Burks技术补完20%、Ulam简化模型输入10%、Turing方法前驱5%、未知5%；均为粗估。", "sources": [ { "label": "研究原文与档案：自复制自动机的逻辑构造与设计补完", "url": "https://fab.cba.mit.edu/classes/862.16/notes/computation/vonNeumann-1966.pdf" }, { "label": "研究原文与档案：自复制自动机的逻辑构造与设计补完", "url": "https://www.tim-taylor.com/selfrepbook/web/chapter-5.html" } ], "missing": "原书第五章细节未逐页核对；Ulam模型输入来自研究专著对原材料的转引；原书第五章未逐页核对；Ulam输入部分来自研究专著转引。", "status": "缺证暂估", "overlapNote": "只取通用构造与描述复制的形式方案，以及Burks对未完成设计的技术补完；排除概率可靠逻辑N11A、存储程序N09A、实际自复制硬件、能量闭合和后继所有元胞自动机。", "M": "5.0", "budget": [ { "actor": "约翰·冯·诺伊曼", "actorId": "SL-0018", "type": "PERSON", "share": "0.60" }, { "actor": "阿瑟·伯克斯", "actorId": "EXT-NAME:ARTHUR-W-BURKS", "type": "PERSON", "share": "0.20" }, { "actor": "斯坦尼斯瓦夫·乌拉姆", "actorId": "EXT-NAME:STANISLAW-ULAM", "type": "PERSON", "share": "0.10" }, { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PREDECESSOR", "share": "0.05" }, { "actor": "未分配", "actorId": "N11B::UNALLOCATED", "type": "UNALLOCATED", "share": "0.05" } ], "share": "0.05", "exactLight": "15.76138830084189665999446772216359266859777569662608413428752426396297219319619110672124054189650148", "light": "15.761388", "standaloneScore": "2.45", "lightSharePercent": "0.5352" }, { "id": "OUT-SL0017-1956-PROBABILISTIC-COMPUTABILITY", "title": "概率机器在可计算及不可计算概率参数下的计算边界", "year": "1956", "summary": "", "M": "4.3", "budget": [ { "actor": "克劳德·香农", "actorId": "SL-0017", "type": "PERSON", "share": ".17" }, { "actor": "Person Karel De Leeuw", "actorId": "PERSON-KAREL-DE-LEEUW", "type": "PERSON", "share": ".17" }, { "actor": "Person Edward F Moore", "actorId": "PERSON-EDWARD-F-MOORE", "type": "PERSON", "share": ".17" }, { "actor": "Person Norman Shapiro", "actorId": "PERSON-NORMAN-SHAPIRO", "type": "PERSON", "share": ".17" }, { "actor": "艾伦·图灵", "actorId": "SL-0006", "type": "PERSON", "share": ".08" }, { "actor": "Person Martin Davis", "actorId": "PERSON-MARTIN-DAVIS", "type": "PERSON", "share": ".03" }, { "actor": "阿隆佐·邱奇", "actorId": "SL-0242", "type": "PERSON", "share": ".01" }, { "actor": "斯蒂芬·克莱尼", "actorId": "SL-1823", "type": "PERSON", "share": ".02" }, { "actor": "埃米尔·波斯特", "actorId": "SL-1824", "type": "PERSON", "share": ".01" }, { "actor": "Person Paul Halmos", "actorId": "PERSON-PAUL-HALMOS", "type": "PERSON", "share": ".06" }, { "actor": "Person E W Hobson", "actorId": "PERSON-E-W-HOBSON", "type": "PERSON", "share": ".04" }, { "actor": "Person J L Doob", "actorId": "PERSON-J-L-DOOB", "type": "PERSON", "share": ".02" }, { "actor": "未分配", "actorId": "PM56::UNALLOCATED", "type": "UNALLOCATED", "share": ".05" } ], "mReason": "M4.3: general and lasting distinction between random input and noncomputable information in computational capability, with independent theorem-level reuse; broader than a narrow counting technique, below a whole computing foundation or universal machine theory.4.0 and4.6 represent narrower theorem versus wider conceptual-method readings.", "aReason": "邱奇在此成果中的归功份额为1.00%。图灵的通用机和可计算性框架是论文中可识别的具体前提；De Leeuw、Moore、Shapiro 的共同证明工作和其他数学输入另列，不能把图灵列成论文作者。", "overlapNote": "One1956 joint knowledge family, Theorems1–5 and their stated effective supplements: p-machine enumeration/ordered sequence relation to deterministic input carrying p; computable p does not enlarge this class; noncomputable p can. c-s-machine computable transition/output functions reduce to fair-coin machines in the specified eventual-output sense.", "status": "已纳入研究估分", "missing": "沿用既有来源和有限主要族评估；未穷尽持续使用、独立替代路径和前驱贡献证据。本次修订并未重新全文核读所有原作。", "sources": [ { "label": "《香农论文集》对应篇章", "url": "https://www.jonglage.net/theorie/notation/siteswap-avancee/refs/books/Claude%20Shannon%20-%20Collected%20Papers.pdf", "note": "作品定位：with Karel de Leeuw, Edward F. Moore and N. Shapiro) Computability by 742 probabilistic machines。书目只用于定位，具体采信范围与量级/归功判断见本项说明；同篇可含多个不同结果。" } ], "share": "0.08", "exactLight": "11.22030035698203441724486291144192743831772920081014808729574847719893048896002867326521267171947706", "light": "11.220300", "standaloneScore": "2.17", "lightSharePercent": "0.3810" } ], "exclusions": [], "provisionalCount": 1, "provenance": { "releaseId": "research-200-20260914", "baselineLedgerSha256": "8bdd406b3e20ae22357644499e622922c670ff11010df0478c70c23b38902108", "c24DeltaSha256": "b0b96144d1d3397e54a61c3d706ff2da5920fe7617e3bef50407149cb97d9d62", "generatorSha256": "25de659e9852503508e7c27d8a31773b8da5d6310531b1e3699d18cc94319929" }, "priorScopeNote": "19项已列贡献的研究估分，含1项暂估。账本覆盖有限的主要成果，尚未穷尽生涯。M与归功份额是可修订的评估判断；未覆盖经历和负面影响不按零处理。", "rank": 20 }