标题： 计算不可约性作为能动性的基础：连接复杂系统中不可判定性与自主行为的形式模型 显示英文标题

标题： Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems

摘要： 本文提出了一种正式模型，证明了真正的自主性——系统自我调节和追求目标的能力——从根本上从外部视角暗示了计算上的不可预测性。 我们建立了精确的数学联系，证明对于任何真正自主的系统，关于其未来行为的问题本质上是不可判定的。 这种形式上的不可判定性，而非仅仅是复杂性，构成了自主系统与非自主系统之间的原则性区别。 我们的框架整合了来自计算理论和生物学的见解，特别是关于涌现的代理性和计算不可约性的见解，以解释新颖的信息和目的如何在一个物理宇宙中产生。 这些发现对人工智能、生物建模以及自由意志等哲学概念具有重要意义。 显示英文摘要

摘要： 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.