发表机构
Centre for Aerospace Strategic Studies (CESA), French Air and Space Force; Technology and Global Affairs Innovation Hub, Paris School of International Affairs (PSIA), Sciences Po（法国空军太空战略研究中心; 巴黎政治学院国际事务创新技术中心）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究将计算自由意志形式化为全局选择，基于层理论，在若干假设下推导得出其存在意味着P与NP分离的结论，结果具有条件性。
AI 中文摘要
我们通过将局部约束的可容许性与全局延续的选择相分离，对计算自由意志进行了形式化。有限选择预层的全局截面构成可容许集GLUE；SELECT则在预先识别的事件处选出已实现的延续。一致迹关系在行为发生后能高效验证该延续，尽管假设其无法从先前事件输入中以多项式时间一致预测。在明确的一致性、平衡性、历史完备性及唯一投影假设下，该迹定义了一个无确定多项式时间选择器的全FNP搜索关系。因此，上述意义下计算自由意志的存在，意味着多项式可验证与多项式可求解搜索之间的分离，进而表明P与NP不同。该结果是有条件的，未给出无条件的类分离。
英文摘要
We formalise computational free will by separating locally constrained admissibility from the selection of one global continuation. Global sections of a finite choice presheaf form an admissible set, GLUE; SELECT singles out the continuation realised at a pre-identified occurrence. A uniform trace relation certifies that continuation efficiently after the act, although it is assumed not to be uniformly anticipable in polynomial time from the prior occurrence input. Under explicit uniformity, balance, historical-completeness, and unique-projection assumptions, this trace defines a total FNP search relation with no deterministic polynomial-time selector. Thus existence of computational free will in the stated sense implies a separation between polynomially verifiable and polynomially solvable search, and hence that P differs from NP. The result is conditional and gives no unconditional class separation.
