真正自主的系统必然不可预测，这是其本质特征。
Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems
- 用数学证明自主系统的行为无法被外部判定
- 揭示了自主性与不可判定性的根本联系
- 适合研究智能、生命与自由意志的学者
本文提出一个形式化模型，表明真正的自主性——系统自我调节并追求目标的能力——本质上意味着从外部视角看行为不可计算预测。我们建立了精确的数学关联，证明任何真正自主的系统，其未来行为问题均不可判定。这种形式上的不可判定性，而非简单复杂性，构成了自主与非自主系统的根本区分。该框架融合计算理论与生物学洞见，特别是关于涌现自主性和计算不可约性的观点，解释了物理宇宙中为何能产生新信息与目的。研究成果对人工智能、生物建模及自由意志等哲学概念具有重要意义。
原文摘要 · Abstract (English)
This article presents a formal model demonstrating that genuine autonomy, the ability of a system to self-regulate and pursue objectives, fundamentally implies computational unpredictability from an external perspective. we establish precise mathematical connections, proving that for any truly autonomous system, questions about its future behavior are fundamentally undecidable. this formal undecidability, rather than mere complexity, grounds a principled distinction between autonomous and non-autonomous systems. our framework integrates insights from computational theory and biology, particularly regarding emergent agency and computational irreducibility, to explain how novel information and purpose can arise within a physical universe. the findings have significant implications for artificial intelligence, biological modeling, and philosophical concepts like free will.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。