Related Experiment Video
Updated: Sep 11, 2025

Characterization of the Sense of Agency over the Actions of Neural-machine Interface-operated Prostheses
Published on: January 7, 2019
Computational irreducibility as the foundation of agency: A formal model connecting undecidability to autonomous
1Institute of Biophysics and Biochemistry, University of Tehran, Tehran, Iran.
Abstract:
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. I 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. My 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.
More Related Videos
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Mechanistic Models: Overview of Compartment Models
Classification of Systems-I
Homogeneity dictates that if an input x(t) is multiplied by a constant c, the output y(t) is multiplied by the same constant. Mathematically, this is expressed as:
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Mechanistic Models: Compartment Models in Individual and Population Analysis

