Life as Plasmas: Autonomy and Interactivism in-materio
Authors: Nicolás Hinrichs, Mahault Albarracin, Felipe Engelberger, Leonardo Christov-Moore, Daniel Polani
Organizations: Max Planck Institute for Human Cognitive and Brain Sciences, Germany · Eigenify, USA · Verses AI Research Lab / Universit´e du Qu´ebec `a Montr´eal, Canada · Institute for Drug Discovery, Universität Leipzig, Germany · Institute for Advanced Consciousness Studies, USA · University of Hertfordshire, UK
Abstract
When is a material system a candidate for life at all? We argue that this question is prior to behavior, functional architecture, or computational capacity, and that at root it is one of physical admissibility. We develop a framework in which minimal autonomy, taken in the interactivist sense of normativity grounded in self-maintaining far-from-equilibrium organization, corresponds to a distinct non-equilibrium phase of matter, and we take complex plasmas, a physical and non-biological system, as its in-materio exemplar. We formalize a diagnostic phase-space whose criteria (sustained free-energy throughput, organizational closure, active information maintenance, and regulated noise sensitivity) constitute necessary conditions for life-attribution. We instantiate the diagnostics across contrasting systems and fix the boundaries of the phase space via Bénard convection as a driven baseline lacking closure, and a digital self-replicating soup that carries measured informational heredity while its physical closure remains a structural zero. We demonstrate that plasmas satisfy every admissibility condition for minimal physical autonomy while carrying none of the informational heredity that open-ended evolution requires, sharpening the distinction between physical admissibility and biological sufficiency, and bounding downstream questions of machine sentience.
Complex adaptive systems often develop organized structures without centralized control. Yet the local mechanisms by which functional organization emerges and persists remain incompletely understood. Here we propose Surviving by Serving (SBS) as a general principle of self-organization: components persist as long as their outputs are utilized by other components, whereas prolonged non-utilization promotes adaptation and exploration. To investigate this idea, we introduce a minimal multi-agent model in which agents transform shared resources and receive only local feedback when their outputs are subsequently utilized elsewhere in the system. Despite the absence of global objectives, the system spontaneously self-organizes into functional interaction networks. We observe the emergence of stable transformation chains, core-periphery organization, and the generation of novel states that enable previously inaccessible target conditions to be reached. Remarkably, self-sustaining interaction networks can arise even without external selection pressures, creating a pre-adaptive search phase from which later functional solutions emerge. These findings suggest that functional utilization may provide a simple, substrate-independent mechanism for the emergence and stabilization of organized structure in complex adaptive systems.
Autonomous science is transforming how we discover materials and chemical systems for advanced energy technologies. However, many initially promising systems never reach deployment. This "valley of death" stems from optimization that prioritizes laboratory metrics over industrial viability. We propose a new strategy: "born-qualified" autonomous development, which embeds manufacturability, cost, and durability constraints from the outset. This approach is enabled by four pillars, including the development of multi-objective metrics, causal models, a modular infrastructure, and embedding manufacturing in the discovery loop. Realizing this vision will require sustained, community-wide commitment, but the potential return on that investment is commensurate with the scale of the challenge.
Steven R. Spurgeon, Milad Abolhasani, Frederick Baddour +28
The ''Computational Life'' paper (Agüera y Arcas et al., 2024) argues that paired interactions in a computational soup are an effective way to find self-replicators. In this work, aided by recent developments in self-replicator detection, we explore the alternate hypothesis that self-replicators can be found at least as easily using simple mutation random walks in program space. We also explore the claim that capping the maximum ''depth'' and ''width'' of the ancestry tree stops self-replicators from emerging, showing instead that it merely stops self-replicators from taking over the soup.