The Minary Primitive of Computational Autopoiesis
Daniel Connor, Colin Defant

TL;DR
This paper introduces Minary, a novel probabilistic framework for autopoiesis that models interactions as superpositions, proving convergence to a stationary distribution and exploring implications for self-maintaining systems.
Contribution
Minary is the first formal primitive for autopoiesis using superposition of probabilistic events, with proven convergence and explicit formulas for consensus dynamics.
Findings
Converges to a unique stationary distribution.
Explicit formulas for mean and variance of consensus.
Consensus depends on competency structure, not raw inputs.
Abstract
We introduce Minary, a computational framework designed as a candidate for the first formally provable autopoietic primitive. Minary represents interacting probabilistic events as multi-dimensional vectors and combines them via linear superposition rather than multiplicative scalar operations, thereby preserving uncertainty and enabling constructive and destructive interference in the range . A fixed set of ``perspectives'' evaluates ``semantic dimensions'' according to hidden competencies, and their interactions drive two discrete-time stochastic processes. We model this system as an iterated random affine map and use the theory of iterated random functions to prove that it converges in distribution to a unique stationary law; we moreover obtain an explicit closed form for the limiting expectation in terms of row, column, and global averages of the competency matrix. We then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEmbodied and Extended Cognition · Language and cultural evolution · Opinion Dynamics and Social Influence
