Related Experiment Video
Updated: Jan 20, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
Published on: March 2, 2015
On Computing Structural and Behavioral Complexities of Threshold Boolean Networks : Application to Biological
Urvan Christen1, Sergiu Ivanov2, Rémi Segretain1
1CNRS, CHU Grenoble Alpes, Grenoble INP, TIMC-IMAG, Univ. Grenoble Alpes, 38000, Grenoble, France.
Abstract:
Various threshold Boolean networks (TBNs), a formalism used to model different types of biological networks (genes notably), can produce similar dynamics, i.e. share same behaviors. Among them, some are complex (according to Kolmogorov complexity), others not. By computing both structural and behavioral complexities, we show that most TBNs are structurally complex, even those having simple behaviors. For this purpose, we developed a new method to compute the structural complexity of a TBN based on estimates of the sizes of equivalence classes of the threshold Boolean functions composing the TBN.
Related Concept Videos
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein Networks
Network Covalent Solids
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
Network Function of a Circuit
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Applications Of NMR In Biology

