EEG microstate syntax analysis: A review of methodological challenges and advances.

Electroencephalography (EEG) microstates are "quasi-stable" periods of electrical potential distribution in multichannel EEG derived from peaks in Global Field Power. Transitions between microstates form a temporal sequence that may reflect underlying neural dynamics. Mounting evidence indicates that EEG microstate sequences have long-range, non-Markovian dependencies, suggesting a complex underlying process that drives EEG microstate syntax (i.

Simulation of a Bio-Inspired Flocking-Based Aggregation Behaviour in Swarm Robotics.

This paper presents a biologically inspired flocking-based aggregation behaviour of a swarm of mobile robots. Aggregation behaviour is essential to many swarm systems, such as swarm robotics systems, in order to accomplish complex tasks that are impossible for a single agent. In this work, we developed a robot controller using Reynolds' flocking rules to coordinate the movements of multiple e-puck robots during the aggregation process.

Self-Reproduction and Evolution in Cellular Automata: 25 Years After Evoloops.

The year 2024 marks the 25th anniversary of the publication of evoloops, an evolutionary variant of Chris Langton's self-reproducing loops, which proved constructively that Darwinian evolution of self-reproducing organisms by variation and natural selection is possible within deterministic cellular automata. Over the last few decades, this line of Artificial Life research has since undergone several important developments. Although it experienced a relative dormancy of activity for a while, the recent rise of interest in open-ended evolution and the success of continuous cellular automata models have brought researchers' attention back to how to make spatiotemporal patterns self-reproduce and evolve within spatially distributed computational media.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Genetic regulatory network models of biological clocks: evolutionary history matters.

We study the evolvability and dynamics of artificial genetic regulatory networks (GRNs), as active control systems, realizing simple models of biological clocks that have evolved to respond to periodic environmental stimuli of various kinds with appropriate periodic behaviors. GRN models may differ in the evolvability of expressive regulatory dynamics. A new class of artificial GRNs with an evolvable number of complex cis-regulatory control sites--each involving a finite number of inhibitory and activatory binding factors--is introduced, allowing realization of complex regulatory logic.

Representations of space and time in the maximization of information flow in the perception-action loop.

Sensor evolution in nature aims at improving the acquisition of information from the environment and is intimately related with selection pressure toward adaptivity and robustness. Our work in the area indicates that information theory can be applied to the perception-action loop. This letter studies the perception-action loop of agents, which is modeled as a causal Bayesian network.

Correspondence mapping induced state and action metrics for robotic imitation.

This paper addresses the problem of body mapping in robotic imitation where the demonstrator and imitator may not share the same embodiment [degrees of freedom (DOFs), body morphology, constraints, affordances, and so on]. Body mappings are formalized using a unified (linear) approach via correspondence matrices, which allow one to capture partial, mirror symmetric, one-to-one, one-to-many, many-to-one, and many-to-many associations between various DOFs across dissimilar embodiments. We show how metrics for matching state and action aspects of behavior can be mathematically determined by such correspondence mappings, which may serve to guide a robotic imitator.