Aggregate Boid behavior to aid in artificial autopoietic organization.

Analyzing carbon-based life on earth can lead to biased inferences on the nature of life as might exist in elsewhere in the universe in alternative forms, therefore, scientists have looked into either abstracting life into constituent systems it is comprised of, or logics of life, or lists of essential criteria, or essential dynamic patterning that characterizes the living. A system-level characterization that is and referred to as a general pattern of minimal life is autopoiesis (Varela et al., 1974) including production, maintenance and replacement of required constituents for setting up and maintaining an internal environment with self/other separation that regulates and is constitutive of processes that produce the environment and components for processes that comprise this ongoing activity of self-production in 'recursively', i.e., in a manner that allows the organizational pattern to continually reconstitute the conditions, components and processes required for its own perpetuation. This seminal concept of an autopoiesis is instantiated in life as we know it, but might also be instantiated in different media and in unforeseen ways. Other researchers have argued life is more than autopoiesis and that it is a co-emergent property of autopoiesis and cognition. Life produces many emergent properties such as synchronization and patterns as seen in flocks and herds of different animal species. The mechanics of this synchrony displayed in flocks and herd animals has been extracted by Craig Reynolds into a generative model referred to as "Boids". With these concepts in mind, we address the following research question: How can the synchronous maneuvers and aggregate behavior of Boids contribute to constitutive subsystems in realizing an autopoietic system? Can such a system exhibit minimal cognition? This work attempts to answer these questions with a bottom-up approach to constructing an artificial life system. We exhibit a computational model of autopoiesis and a minimal level of cognition in the sense of M. Bitbol and P. Luigi Luisi, whereby an autopoietic entity engages in active assimilation of external components as part of its activity of self-production.

Autocatalysis, Autopoiesis, and the Opportunity Cost of Individuality.

Ever since Varela and Maturana proposed the concept of autopoiesis as the minimal requirement for life, there has been a focus on cellular systems that erect topological boundaries to separate themselves from their surrounding environment. Here, we reconsider whether the existence of such a spatial boundary is strictly necessary for self-producing entities. This work presents a novel computational model of a minimal autopoietic system inspired by dendrites and molecular dynamic simulations in three-dimensional space. A series of simulation experiments where the metabolic pathways of a particular autocatalytic set are successively inhibited until autocatalytic entities that could be considered autopoietic are produced. These entities maintain their distinctness in an environment containing multiple identical instances of the entities without the existence of a topological boundary. This gives rise to the concept of a metabolic boundary which manifests as emergent self-selection criteria for the processes of self-production without any need for unique identifiers. However, the adoption of such a boundary comes at a cost, as these autopoietic entities are less suited to their simulated environment than their autocatalytic counterparts. Finally, this work showcases a generalized metabolism-centered approach to the study of autopoiesis that can be applied to both physical and abstract systems alike.

EEG-Meta-Microstates: Towards a More Objective Use of Resting-State EEG Microstate Findings Across Studies.

Over the last decade, EEG resting-state microstate analysis has evolved from a niche existence to a widely used and well-accepted methodology. The rapidly increasing body of empirical findings started to yield overarching patterns of associations of biological and psychological states and traits with specific microstate classes. However, currently, this cross-referencing among apparently similar microstate classes of different studies is typically done by "eyeballing" of printed template maps by the individual authors, lacking a systematic procedure. To improve the reliability and validity of future findings, we present a tool to systematically collect the actual data of template maps from as many published studies as possible and present them in their entirety as a matrix of spatial similarity. The tool also allows importing novel template maps and systematically extracting the findings associated with specific microstate maps from ongoing or published studies. The tool also allows importing novel template maps and systematically extracting the findings associated with specific microstate maps in the literature. The analysis of 40 included sets of template maps indicated that: (i) there is a high degree of similarity of template maps across studies, (ii) similar template maps were associated with converging empirical findings, and (iii) representative meta-microstates can be extracted from the individual studies. We hope that this tool will be useful in coming to a more comprehensive, objective, and overarching representation of microstate findings.

Measuring Time with Minimal Clocks.

Being able to measure time, whether directly or indirectly, is a significant advantage for an organism. It allows for timely reaction to regular or predicted events, reducing the pressure for fast processing of sensory input. Thus, clocks are ubiquitous in biology. In the present article, we consider minimal abstract pure clocks in different configurations and investigate their characteristic dynamics. We are especially interested in optimally time-resolving clocks. Among these, we find fundamentally diametral clock characteristics, such as oscillatory behavior for purely local time measurement or decay-based clocks measuring time periods on a scale global to the problem. We include also sets of independent clocks (clock bags), sequential cascades of clocks, and composite clocks with controlled dependence. Clock cascades show a condensation effect, and the composite clock shows various regimes of markedly different dynamics.

Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions.

Interaction computing is inspired by the observation that cell metabolic/regulatory systems construct order dynamically, through constrained interactions between their components and based on a wide range of possible inputs and environmental conditions. The goals of this work are to (i) identify and understand mathematically the natural subsystems and hierarchical relations in natural systems enabling this and (ii) use the resulting insights to define a new model of computation based on interactions that is useful for both biology and computation. The dynamical characteristics of the cellular pathways studied in systems biology relate, mathematically, to the computational characteristics of automata derived from them, and their internal symmetry structures to computational power. Finite discrete automata models of biological systems such as the lac operon, the Krebs cycle and p53-mdm2 genetic regulation constructed from systems biology models have canonically associated algebraic structures (their transformation semigroups). These contain permutation groups (local substructures exhibiting symmetry) that correspond to 'pools of reversibility'. These natural subsystems are related to one another in a hierarchical manner by the notion of 'weak control'. We present natural subsystems arising from several biological examples and their weak control hierarchies in detail. Finite simple non-Abelian groups are found in biological examples and can be harnessed to realize finitary universal computation. This allows ensembles of cells to achieve any desired finitary computational transformation, depending on external inputs, via suitably constrained interactions. Based on this, interaction machines that grow and change their structure recursively are introduced and applied, providing a natural model of computation driven by interactions.

The ITALK project: a developmental robotics approach to the study of individual, social, and linguistic learning.

This article presents results from a multidisciplinary research project on the integration and transfer of language knowledge into robots as an empirical paradigm for the study of language development in both humans and humanoid robots. Within the framework of human linguistic and cognitive development, we focus on how three central types of learning interact and co-develop: individual learning about one's own embodiment and the environment, social learning (learning from others), and learning of linguistic capability. Our primary concern is how these capabilities can scaffold each other's development in a continuous feedback cycle as their interactions yield increasingly sophisticated competencies in the agent's capacity to interact with others and manipulate its world. Experimental results are summarized in relation to milestones in human linguistic and cognitive development and show that the mutual scaffolding of social learning, individual learning, and linguistic capabilities creates the context, conditions, and requisites for learning in each domain. Challenges and insights identified as a result of this research program are discussed with regard to possible and actual contributions to cognitive science and language ontogeny. In conclusion, directions for future work are suggested that continue to develop this approach toward an integrated framework for understanding these mutually scaffolding processes as a basis for language development in humans and robots.

Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov-Zhabotinsky reaction.

Interaction computing (IC) aims to map the properties of integrable low-dimensional non-linear dynamical systems to the discrete domain of finite-state automata in an attempt to reproduce in software the self-organizing and dynamically stable properties of sub-cellular biochemical systems. As the work reported in this paper is still at the early stages of theory development it focuses on the analysis of a particularly simple chemical oscillator, the Belousov-Zhabotinsky (BZ) reaction. After retracing the rationale for IC developed over the past several years from the physical, biological, mathematical, and computer science points of view, the paper presents an elementary discussion of the Krohn-Rhodes decomposition of finite-state automata, including the holonomy decomposition of a simple automaton, and of its interpretation as an abstract positional number system. The method is then applied to the analysis of the algebraic properties of discrete finite-state automata derived from a simplified Petri net model of the BZ reaction. In the simplest possible and symmetrical case the corresponding automaton is, not surprisingly, found to contain exclusively cyclic groups. In a second, asymmetrical case, the decomposition is much more complex and includes five different simple non-abelian groups whose potential relevance arises from their ability to encode functionally complete algebras. The possible computational relevance of these findings is discussed and possible conclusions are drawn.

Interactive language learning by robots: the transition from babbling to word forms.

The advent of humanoid robots has enabled a new approach to investigating the acquisition of language, and we report on the development of robots able to acquire rudimentary linguistic skills. Our work focuses on early stages analogous to some characteristics of a human child of about 6 to 14 months, the transition from babbling to first word forms. We investigate one mechanism among many that may contribute to this process, a key factor being the sensitivity of learners to the statistical distribution of linguistic elements. As well as being necessary for learning word meanings, the acquisition of anchor word forms facilitates the segmentation of an acoustic stream through other mechanisms. In our experiments some salient one-syllable word forms are learnt by a humanoid robot in real-time interactions with naive participants. Words emerge from random syllabic babble through a learning process based on a dialogue between the robot and the human participant, whose speech is perceived by the robot as a stream of phonemes. Numerous ways of representing the speech as syllabic segments are possible. Furthermore, the pronunciation of many words in spontaneous speech is variable. However, in line with research elsewhere, we observe that salient content words are more likely than function words to have consistent canonical representations; thus their relative frequency increases, as does their influence on the learner. Variable pronunciation may contribute to early word form acquisition. The importance of contingent interaction in real-time between teacher and learner is reflected by a reinforcement process, with variable success. The examination of individual cases may be more informative than group results. Nevertheless, word forms are usually produced by the robot after a few minutes of dialogue, employing a simple, real-time, frequency dependent mechanism. This work shows the potential of human-robot interaction systems in studies of the dynamics of early language acquisition.

Perception-action loops of multiple agents: informational aspects and the impact of coordination.

Embodied agents can be conceived as entities perceiving and acting upon an external environment. Probabilistic models of this perception-action loop have paved the way to the investigation of information-theoretic aspects of embodied cognition. This formalism allows (i) to identify information flows and their limits under various scenarios and constraints, and (ii) to use informational quantities in order to induce the self-organization of the agent's behavior without any externally specified drives. This article extends the perception-action loop formalism to multiple agents. The multiple-access channel model is presented and used to identify the relationships between informational quantities of two agents interacting in the same environment. The central question investigated in this article is the impact of coordination. Information-theoretic limits on what can be achieved with and without coordination are identified. For this purpose, different abstract channels are studied, along with a concrete example of agents interacting in space. It is shown that, under some conditions, self-organizing systems based on information-theoretic quantities have a tendency to spontaneously generate coordinated behavior. Moreover, in the perspective of engineering such systems to achieve specific tasks, these information-theoretic limits put constraints on the amount of coordination that is required to perform the task, and consequently on the mechanisms that underlie self-organization in the system.

Genetic algorithms and their application to in silico evolution of genetic regulatory networks.

A genetic algorithm (GA) is a procedure that mimics processes occurring in Darwinian evolution to solve computational problems. A GA introduces variation through "mutation" and "recombination" in a "population" of possible solutions to a problem, encoded as strings of characters in "genomes," and allows this population to evolve, using selection procedures that favor the gradual enrichment of the gene pool with the genomes of the "fitter" individuals. GAs are particularly suitable for optimization problems in which an effective system design or set of parameter values is sought.In nature, genetic regulatory networks (GRNs) form the basic control layer in the regulation of gene expression levels. GRNs are composed of regulatory interactions between genes and their gene products, and are, inter alia, at the basis of the development of single fertilized cells into fully grown organisms. This paper describes how GAs may be applied to find functional regulatory schemes and parameter values for models that capture the fundamental GRN characteristics. The central ideas behind evolutionary computation and GRN modeling, and the considerations in GA design and use are discussed, and illustrated with an extended example. In this example, a GRN-like controller is sought for a developmental system based on Lewis Wolpert's French flag model for positional specification, in which cells in a growing embryo secrete and detect morphogens to attain a specific spatial pattern of cellular differentiation.

Stochastic model of template-directed elongation processes in biology.

We present a novel modular, stochastic model for biological template-based linear chain elongation processes. In this model, elongation complexes (ECs; DNA polymerase, RNA polymerase, or ribosomes associated with nascent chains) that span a finite number of template units step along the template, one after another, with semaphore constructs preventing overtaking. The central elongation module is readily extended with modules that represent initiation and termination processes. The model was used to explore the effect of EC span on motor velocity and dispersion, and the effect of initiation activator and repressor binding kinetics on the overall elongation dynamics. The results demonstrate that (1) motors that move smoothly are able to travel at a greater velocity and closer together than motors that move more erratically, and (2) the rate at which completed chains are released is proportional to the occupancy or vacancy of activator or repressor binding sites only when initiation or activator/repressor dissociation is slow in comparison with elongation.

Keep your options open: an information-based driving principle for sensorimotor systems.

The central resource processed by the sensorimotor system of an organism is information. We propose an information-based quantity that allows one to characterize the efficiency of the perception-action loop of an abstract organism model. It measures the potential of the organism to imprint information on the environment via its actuators in a way that can be recaptured by its sensors, essentially quantifying the options available and visible to the organism. Various scenarios suggest that such a quantity could identify the preferred direction of evolution or adaptation of the sensorimotor loop of organisms.

Algebraic properties of automata associated to Petri nets and applications to computation in biological systems.

Biochemical and genetic regulatory networks are often modeled by Petri nets. We study the algebraic structure of the computations carried out by Petri nets from the viewpoint of algebraic automata theory. Petri nets comprise a formalized graphical modeling language, often used to describe computation occurring within biochemical and genetic regulatory networks, but the semantics may be interpreted in different ways in the realm of automata. Therefore, there are several different ways to turn a Petri net into a state-transition automaton. Here, we systematically investigate different conversion methods and describe cases where they may yield radically different algebraic structures. We focus on the existence of group components of the corresponding transformation semigroups, as these reflect symmetries of the computation occurring within the biological system under study. Results are illustrated by applications to the Petri net modelling of intermediary metabolism. Petri nets with inhibition are shown to be computationally rich, regardless of the particular interpretation method. Along these lines we provide a mathematical argument suggesting a reason for the apparent all-pervasiveness of inhibitory connections in living systems.

Do motifs reflect evolved function?--No convergent evolution of genetic regulatory network subgraph topologies.

Methods that analyse the topological structure of networks have recently become quite popular. Whether motifs (subgraph patterns that occur more often than in randomized networks) have specific functions as elementary computational circuits has been cause for debate. As the question is difficult to resolve with currently available biological data, we approach the issue using networks that abstractly model natural genetic regulatory networks (GRNs) which are evolved to show dynamical behaviors. Specifically one group of networks was evolved to be capable of exhibiting two different behaviors ("differentiation") in contrast to a group with a single target behavior. In both groups we find motif distribution differences within the groups to be larger than differences between them, indicating that evolutionary niches (target functions) do not necessarily mold network structure uniquely. These results show that variability operators can have a stronger influence on network topologies than selection pressures, especially when many topologies can create similar dynamics. Moreover, analysis of motif functional relevance by lesioning did not suggest that motifs were of greater importance to the functioning of the network than arbitrary subgraph patterns. Only when drastically restricting network size, so that one motif corresponds to a whole functionally evolved network, was preference for particular connection patterns found. This suggests that in non-restricted, bigger networks, entanglement with the rest of the network hinders topological subgraph analysis.

Communication and complexity in a GRN-based multicellular system for graph colouring.

Artificial Genetic Regulatory Networks (GRNs) are interesting control models through their simplicity and versatility. They can be easily implemented, evolved and modified, and their similarity to their biological counterparts makes them interesting for simulations of life-like systems as well. These aspects suggest they may be perfect control systems for distributed computing in diverse situations, but to be usable for such applications the computational power and evolvability of GRNs need to be studied. In this research we propose a simple distributed system implementing GRNs to solve the well known NP-complete graph colouring problem. Every node (cell) of the graph to be coloured is controlled by an instance of the same GRN. All the cells communicate directly with their immediate neighbours in the graph so as to set up a good colouring. The quality of this colouring directs the evolution of the GRNs using a genetic algorithm. We then observe the quality of the colouring for two different graphs according to different communication protocols and the number of different proteins in the cell (a measure for the possible complexity of a GRN). Those two points, being the main scalability issues that any computational paradigm raises, will then be discussed.

Automatic analysis of computation in biochemical reactions.

We propose a modeling and analysis method for biochemical reactions based on finite state automata. This is a completely different approach compared to traditional modeling of reactions by differential equations. Our method aims to explore the algebraic structure behind chemical reactions using automatically generated coordinate systems. In this paper we briefly summarize the underlying mathematical theory (the algebraic hierarchical decomposition theory of finite state automata) and describe how such automata can be derived from the description of chemical reaction networks. We also outline techniques for the flexible manipulation of existing models. As a real-world example we use the Krebs citric acid cycle.

Hierarchical coordinate systems for understanding complexity and its evolution, with applications to genetic regulatory networks.

Beyond complexity measures, sometimes it is worthwhile in addition to investigate how complexity changes structurally, especially in artificial systems where we have complete knowledge about the evolutionary process. Hierarchical decomposition is a useful way of assessing structural complexity changes of organisms modeled as automata, and we show how recently developed computational tools can be used for this purpose, by computing holonomy decompositions and holonomy complexity. To gain insight into the evolution of complexity, we investigate the smoothness of the landscape structure of complexity under minimal transitions. As a proof of concept, we illustrate how the hierarchical complexity analysis reveals symmetries and irreversible structure in biological networks by applying the methods to the lac operon mechanism in the genetic regulatory network of Escherichia coli.

Bio-logic: gene expression and the laws of combinatorial logic.

At the heart of the development of fertilized eggs into fully formed organisms and the adaptation of cells to changed conditions are genetic regulatory networks (GRNs). In higher multicellular organisms, signal selection and multiplexing are performed at the cis-regulatory domains of genes, where combinations of transcription factors (TFs) regulate the rates at which the genes are transcribed into mRNA. To be able to act as activators or repressors of gene transcription, TFs must first bind to target sequences on the regulatory domains. Two TFs that act in concert may bind entirely independently of each other, but more often binding of the first one will alter the affinity of the other for its binding site. This article presents a systematic investigation into the effect of TF binding dependences on the predicted regulatory function of this bio-logic. Four extreme scenarios, commonly used to classify enzyme activation and inhibition patterns, for the binding of two TFs were explored: independent (the TFs bind without affecting each other's affinities), competitive (the TFs compete for the same binding site), ordered (the TFs bind in a compulsory order), and joint binding (the TFs either bind as a preformed complex, or binding of one is virtually impossible in the absence of the other). The conclusions are: (1) the laws of combinatorial logic hold only for systems with independently binding TFs; (2) systems formed according to the other scenarios can mimic the functions of their Boolean logical counterparts, but cannot be combined or decomposed in the same way; and (3) the continuously scaled output of systems consisting of competitively binding activators and repressors can be controlled more robustly than that of single TF or (quasi-)logical multi-TF systems.