发表机构
Centre for Aerospace Strategic Studies, French Air and Space Force; Paris School of International Affairs (PSIA), Sciences Po（法国空军太空部队航空战略研究中心; 巴黎政治学院国际事务学院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文通过公理化方法刻画实质能动性，证明在特定桥梁条件下P与NP有条件分离，并构造认证实现协议将历史实现转化为TFNP搜索中的标准搜索关系。
AI 中文摘要
本文刻画了实质能动性，并识别出使其具有标准复杂性理论后果的额外桥梁：有条件地，P ≠ NP。其构成性核心区分了连贯的多元性、因果开放性、预期性非指向、行动层面单一化以及内生来源性。其时间性主张产生了一个双面模态结果：精确的被动预行动选择与同时保留单一化优先性和在因果惰性信息扩展下的不变性不相容。如果每个标准多项式过程都能以那种被动形式部署，则实现映射α没有多项式时间选择器。在有效呈现上，α因此要么在FP之外可计算，要么不可计算。一个单独的认证实现协议提供多项式有界、多项式可验证的轨迹，具有外延唯一投影。这是将历史实现转化为完全标准搜索关系的建设性接口；结合模态结果，它将该关系置于TFNP搜索 \ FP搜索中，从中一个自包含的搜索论证得出P ≠ NP。结果是一个领域相对的条件转移定理：它既不在能动性定义中假设多项式不可预知性，也不证明人类决策满足桥梁和认证前提。
英文摘要
This paper characterises substantive agency and identifies the additional bridges under which it has a standard complexity-theoretic consequence: conditionally, P __ = N P . The constitutive core separates coherent plurality, causal openness, anticipatory non-pointing, act-level singularisation, and endogenous sourcehood. Its temporal claim yields a two-sided modal result: exact passive pre-act selection is incompatible with jointly retaining singularising priority and invariance under causally inert informational extension. If every standard polynomial procedure is deployable in that passive form, the actualisation map $α$ has no polynomial-time selector. On an effective presentation, $α$ is therefore either computable outside FP or noncomputable. A separate certifiedactualisation protocol supplies polynomially bounded, polynomially verifiable traces with extensional unique projection. This is the constructive interface that turns historical actualisation into a total standard search relation; combined with the modal result, it places that relation in TFNP search \ FP search , from which a self-contained search argument yields P __ = N P . The result is a domain-relative conditional transfer theorem: it neither assumes polynomial non-anticipability in the definition of agency nor proves that human decision-making satisfies the bridge and certification premises.
