Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 141 of the 141 references it cites were found in a registry or an index.

Modeling somatic computation with non-neural bioelectric networks

Open access
Manicka, Santosh, Levin, Michael · 2019 · Scientific Reports

Abstract

The field of basal cognition seeks to understand how adaptive, context-specific behavior occurs in non-neural biological systems. Embryogenesis and regeneration require plasticity in many tissue types to achieve structural and functional goals in diverse circumstances. Thus, advances in both evolutionary cell biology and regenerative medicine require an understanding of how non-neural tissues could process information. Neurons evolved from ancient cell types that used bioelectric signaling to perform computation. However, it has not been shown whether or how non-neural bioelectric cell networks can support computation. We generalize connectionist methods to non-neural tissue architectures, showing that a minimal non-neural Bio-Electric Network (BEN) model that utilizes the general principles of bioelectricity (electrodiffusion and gating) can compute. We characterize BEN behaviors ranging from elementary logic gates to pattern detectors, using both fixed and transient inputs to recapitulate various biological scenarios. We characterize the mechanisms of such networks using dynamical-systems and information-theory tools, demonstrating that logic can manifest in bidirectional, continuous, and relatively slow bioelectrical systems, complementing conventional neural-centric architectures. Our results reveal a variety of non-neural decision-making processes as manifestations of general cellular biophysical mechanisms and suggest novel bioengineering approaches to construct functional tissues for regenerative medicine and synthetic biology as well as new machine learning architectures.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41598-019-54859-8

Cites

141 of 141 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Schematics of the BEN architecture and its constituents. (a) The general architecture of a BEN network; (b) A BEN network consisting of two cells; (c) The network of components (black) related by processes (blue, red and green) within a single cell, some of which receive inputs from adjacent cells. For example, the Vmem of a cell together with that of the adjacent cell gates the gap junction which in turn affects the concentrations of the ion and the signaling molecule, and the ion concentration ultimately determines the Vmem, closing the loop. This highlights the recurrent nature of the dynamics in BEN.
Figure 1 Schematics of the BEN architecture and its constituents. (a) The general architecture of a BEN network; (b) A BEN network consisting of two cells; (c) The network of components (black) related by processes (blue, red and green) within a single cell, some of which receive inputs from adjacent cells. For example, the Vmem of a cell together with that of the adjacent cell gates the gap junction which in turn affects the concentrations of the ion and the signaling molecule, and the ion concentration ultimately determines the Vmem, closing the loop. This highlights the recurrent nature of the dynamics in BEN.CC BY · PubMed Central
Figure 2 The AND gate. (a) A schematic of the AND logic gate and its rule table. The orange and purple cells are the inputs, and the green cell is the output; the grey cells are intermediate cells offering computational support. (b) Specification of the output Vmem for various combinations of input Vmem levels. This is known as the “truth table” in the Boolean logic literature, where the “hyperpolarized” state (around −80 mV) is indicated as “0”, “False” or “OFF” and the “depolarized” state (around +80 mV) as “1”, “True” or “ON”. This rule table essentially summarizes the mechanism of the BEN-based AND gate: the output is depolarized only when both of its inputs are depolarized; in Boolean logic terms the output is ON only when both inputs are ON. (c) Pareto front of training errors over time (one unit is equal to a single training epoch) for the AND gate. This plot depicts the “front” with the best errors achieved over time. This figure demonstrates that the training does indeed result in learning. (d) The behavior of the best AND gate shown in the form of time series of the input and output nodes of the gate, shown for all four input-output conditions generated in a random sequence. The red and blue lines represent the states of the two input nodes, and green represents the output. The grey triangles mark the time points at which the inputs are switched to a different state. For example, both inputs are hyperpolarized at time point (1), while at time point (2) the red input is depolarized. (e) The dynamical phase of the logic gate:a depiction of a set of trajectories in the input-output space, illustrated in a time-lapse style. This dynamical system has two attractors in the output space, highlighted in filled red (depolarized state) and blue (hyperpolarized state) circles. The trajectories look straight because the inputs are fixed, and only the output changes.
Figure 2 The AND gate. (a) A schematic of the AND logic gate and its rule table. The orange and purple cells are the inputs, and the green cell is the output; the grey cells are intermediate cells offering computational support. (b) Specification of the output Vmem for various combinations of input Vmem levels. This is known as the “truth table” in the Boolean logic literature, where the “hyperpolarized” state (around −80 mV) is indicated as “0”, “False” or “OFF” and the “depolarized” state (around +80 mV) as “1”, “True” or “ON”. This rule table essentially summarizes the mechanism of the BEN-based AND gate: the output is depolarized only when both of its inputs are depolarized; in Boolean logic terms the output is ON only when both inputs are ON. (c) Pareto front of training errors over time (one unit is equal to a single training epoch) for the AND gate. This plot depicts the “front” with the best errors achieved over time. This figure demonstrates that the training does indeed result in learning. (d) The behavior of the best AND gate shown in the form of time series of the input and output nodes of the gate, shown for all four input-output conditions generated in a random sequence. The red and blue lines represent the states of the two input nodes, and green represents the output. The grey triangles mark the time points at which the inputs are switched to a different state. For example, both inputs are hyperpolarized at time point (1), while at time point (2) the red input is depolarized. (e) The dynamical phase of the logic gate:a depiction of a set of trajectories in the input-output space, illustrated in a time-lapse style. This dynamical system has two attractors in the output space, highlighted in filled red (depolarized state) and blue (hyperpolarized state) circles. The trajectories look straight because the inputs are fixed, and only the output changes.CC BY · PubMed Central
Figure 3 The XOR gate. (a) Schematic of the XOR logic gate; the orange and purple cells are the inputs, and the green cell is the output; the grey cells are intermediate cells offering computational support. (b) The XOR rule table: output is depolarized only when one of its inputs, but not both, is depolarized. Table specifies the output Vmem for various combinations of input Vmem levels; this is known as the “truth table” in the Boolean logic literature, where the “hyperpolarized” state (around −80 mV) is indicated as “0”, “False” or “OFF” and the “depolarized” state (around +80 mV) as “1”, “True” or “ON”. (c) Pareto front of training errors over time (one unit is equal to a single training epoch) for the XOR gate. This plot depicts the “front” with the best errors achieved over time. This figure demonstrates that the training does indeed result in learning, but fewer networks are successful compared to AND (Fig. 2). (d) Behavior of the best XOR gate. Shown here are the time series of the input and output nodes of the gate, shown for all four input-output conditions generated in a random sequence. The red and blue lines represent the states of the two input nodes, and green represents the output. The grey triangles mark the time points at which the inputs are switched to a different state. (e) The dynamical phase space of the gate: a depiction of a set of trajectories in the input-output space, illustrated in a time-lapse style. This dynamical system has two attractors in the output space, highlighted in filled red (depolarized state) and blue (hyperpolarized state) circles. The trajectories look straight because the inputs are fixed, and only the output changes.
Figure 3 The XOR gate. (a) Schematic of the XOR logic gate; the orange and purple cells are the inputs, and the green cell is the output; the grey cells are intermediate cells offering computational support. (b) The XOR rule table: output is depolarized only when one of its inputs, but not both, is depolarized. Table specifies the output Vmem for various combinations of input Vmem levels; this is known as the “truth table” in the Boolean logic literature, where the “hyperpolarized” state (around −80 mV) is indicated as “0”, “False” or “OFF” and the “depolarized” state (around +80 mV) as “1”, “True” or “ON”. (c) Pareto front of training errors over time (one unit is equal to a single training epoch) for the XOR gate. This plot depicts the “front” with the best errors achieved over time. This figure demonstrates that the training does indeed result in learning, but fewer networks are successful compared to AND (Fig. 2). (d) Behavior of the best XOR gate. Shown here are the time series of the input and output nodes of the gate, shown for all four input-output conditions generated in a random sequence. The red and blue lines represent the states of the two input nodes, and green represents the output. The grey triangles mark the time points at which the inputs are switched to a different state. (e) The dynamical phase space of the gate: a depiction of a set of trajectories in the input-output space, illustrated in a time-lapse style. This dynamical system has two attractors in the output space, highlighted in filled red (depolarized state) and blue (hyperpolarized state) circles. The trajectories look straight because the inputs are fixed, and only the output changes.CC BY · PubMed Central
Figure 4 The structure and behavior of the best evolved tissue-level AND gate. Following the convention of the color-coding, orange and purple represent input nodes, while green represents the output node. Behavior correctly follows the AND rule (Fig. 2b). Inputs are transient: they are set (externally) to their respective states at the time steps marked by the grey triangles and then removed. As can be seen, they slightly oscillate for a small period of time after they are set initially, before dynamically fixing themselves (marked by grey dashed arrows) during every simulation. Thus, the network has evolved the capacity for memory: it remembers the inputs (at least their qualitative levels) even after they are removed. Inset shows the structure of the network.
Figure 4 The structure and behavior of the best evolved tissue-level AND gate. Following the convention of the color-coding, orange and purple represent input nodes, while green represents the output node. Behavior correctly follows the AND rule (Fig. 2b). Inputs are transient: they are set (externally) to their respective states at the time steps marked by the grey triangles and then removed. As can be seen, they slightly oscillate for a small period of time after they are set initially, before dynamically fixing themselves (marked by grey dashed arrows) during every simulation. Thus, the network has evolved the capacity for memory: it remembers the inputs (at least their qualitative levels) even after they are removed. Inset shows the structure of the network.CC BY · PubMed Central
Figure 5 The dynamical phase space of the best tissue-level AND gate. A depiction of a set of trajectories in the input-output space, illustrated in a time-lapse style. This dynamical system has two attractors in the output space, highlighted in filled blue (hyperpolarized state) and red (depolarized state) circles. As can be seen, there are three standard hyperpolarized attractors (fixed-point-like), and a fourth cyclic hyperpolarized attractor (marked with a blue arrow). Even though the cyclic attractor is in the appropriate region of the phase space, it was not actually required for during the training—it accidentally emerged. Furthermore, as opposed to the straight trajectories of the previous phase space diagrams, the trajectories maneuver freely here, and occasionally spill over the usual Vmem range which is about [−100,100] mV. This is because the inputs are transient and not fixed, hence they change states as well over time.
Figure 5 The dynamical phase space of the best tissue-level AND gate. A depiction of a set of trajectories in the input-output space, illustrated in a time-lapse style. This dynamical system has two attractors in the output space, highlighted in filled blue (hyperpolarized state) and red (depolarized state) circles. As can be seen, there are three standard hyperpolarized attractors (fixed-point-like), and a fourth cyclic hyperpolarized attractor (marked with a blue arrow). Even though the cyclic attractor is in the appropriate region of the phase space, it was not actually required for during the training—it accidentally emerged. Furthermore, as opposed to the straight trajectories of the previous phase space diagrams, the trajectories maneuver freely here, and occasionally spill over the usual Vmem range which is about [−100,100] mV. This is because the inputs are transient and not fixed, hence they change states as well over time.CC BY · PubMed Central
Figure 6 The French-flag detector. (a) Snapshots of the equilibrium (final) network states (Vmem levels) in two detection scenarios. Left: input pattern is the French flag, and the output is depolarized (representing “correct” pattern). Right: input pattern is a highly distorted version of the French flag, and the output is hyperpolarized (representing “incorrect” pattern). Colors represent polarity levels of the cells in units of mV. Notice that the only three intermediate cells that differ in their states between the two cases are those marked with a black star, suggesting that the detector makes minimal use of information to distinguish between patterns. Also notice that the edges are thicker in the right than in the left, suggesting that the voltage-gating dynamics of the edges (representing gap junctions) play a crucial role. (b) The overall performance of the best evolved pattern detector, with data collected from a set of 1000 simulations: 100 parallel sets each with a random sequence of 10 simulations. As expected, the pattern detector classifies patterns similar to the French flag (a total of 500 sample inputs) as “French flag”, and those that are dissimilar (500 inputs) as “not French flag”. This suggests that the pattern detector is robust to noise to a sensible extent. The width of the classification boundary was set implicitly due to the way sample input patterns from the two classes were generated (details in the ‘Methods’ section). (c) The behavior of the best French-flag detector shown for a set of four representative cells (three inputs out of a total of eighteen and one output) for a random sequence of five patterns. Inset highlights the four nodes whose colors correspond with those in the time series. Highlighted in grey squares are the cases where a French-flag-like pattern is input for which the output is depolarized, as expected; for all other cases where a random pattern is shown, the output is hyperpolarized.
Figure 6 The French-flag detector. (a) Snapshots of the equilibrium (final) network states (Vmem levels) in two detection scenarios. Left: input pattern is the French flag, and the output is depolarized (representing “correct” pattern). Right: input pattern is a highly distorted version of the French flag, and the output is hyperpolarized (representing “incorrect” pattern). Colors represent polarity levels of the cells in units of mV. Notice that the only three intermediate cells that differ in their states between the two cases are those marked with a black star, suggesting that the detector makes minimal use of information to distinguish between patterns. Also notice that the edges are thicker in the right than in the left, suggesting that the voltage-gating dynamics of the edges (representing gap junctions) play a crucial role. (b) The overall performance of the best evolved pattern detector, with data collected from a set of 1000 simulations: 100 parallel sets each with a random sequence of 10 simulations. As expected, the pattern detector classifies patterns similar to the French flag (a total of 500 sample inputs) as “French flag”, and those that are dissimilar (500 inputs) as “not French flag”. This suggests that the pattern detector is robust to noise to a sensible extent. The width of the classification boundary was set implicitly due to the way sample input patterns from the two classes were generated (details in the ‘Methods’ section). (c) The behavior of the best French-flag detector shown for a set of four representative cells (three inputs out of a total of eighteen and one output) for a random sequence of five patterns. Inset highlights the four nodes whose colors correspond with those in the time series. Highlighted in grey squares are the cases where a French-flag-like pattern is input for which the output is depolarized, as expected; for all other cases where a random pattern is shown, the output is hyperpolarized.CC BY · PubMed Central
Figure 7 The behavior of a successfully trained NAND gate for a random sequence of four inputs. Orange and purple lines represent the activities of the inputs, while green represents the output. The vertical dashed lines mark the beginning of each trial in the sequence, however the inputs are applied, after an initial transient, at the time points marked by the grey triangles. Inset is a schematic of the architecture of the gate: pretrained AND and NOT gates are connected by a “bridge”, a single layer of cells, that is alone trained.
Figure 7 The behavior of a successfully trained NAND gate for a random sequence of four inputs. Orange and purple lines represent the activities of the inputs, while green represents the output. The vertical dashed lines mark the beginning of each trial in the sequence, however the inputs are applied, after an initial transient, at the time points marked by the grey triangles. Inset is a schematic of the architecture of the gate: pretrained AND and NOT gates are connected by a “bridge”, a single layer of cells, that is alone trained.CC BY · PubMed Central
Figure 8 Mathematical details of the BEN model. (Top) The equations that describe the dynamics in a 2-cell system illustrated in the figure on the left. (Bottom) A glossary of variables used in the equations, the constants and initial conditions.
Figure 8 Mathematical details of the BEN model. (Top) The equations that describe the dynamics in a 2-cell system illustrated in the figure on the left. (Bottom) A glossary of variables used in the equations, the constants and initial conditions.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 140 references

Research works printed but not linked: 5

  1. Albert, R. E. In Complex Networks. Lecture Notes in Physics Vol. 650 (ed Frauenfelder H. Ben-Naim E., Toroczkai Z.) (Springer, 2004).
  2. Pai, V. P. et al. HCN2 Rescues brain defects by enforcing endogenous voltage pre-patterns. Nat Commun 9, 998, https://doi.org/10.1038/s41467-018-03334-5 (2018). · DOI
  3. Ferreira, G. B., Matthias, S. & Levin, M. In European Conference on Artificial Life. 170–177 (MIT Press).
  4. Levin, M. Z. B. A. M. In Artificial Life 351–358 (MIT Press, 2018).
  5. Levin, M. & Martyniuk, C. J. The bioelectric code: An ancient computational medium for dynamic control of growth and form. Biosystems 164, 76–93, https://doi.org/10.1016/j.biosystems.2017.08.009 (2018). · DOI · Paper page

Cited by

See all 41

Metadata

Authors
Manicka, S., & Levin, M.
Affiliations
Tufts University (US)
Corresponding author
Levin, Michael
Venue
Scientific Reports
Published
2019-12-09
Volume
9
Issue
1
Pages
18612-18612
ISSN
2045-2322 (ISSN-L)
OpenAlex
W2992017056
Cited by
41
References
140
Citations by year
2026: 2 · 2025: 7 · 2024: 3 · 2023: 8 · 2022: 8 · 2021: 8 · 2020: 5
FWCI
3.05
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
  • Paul G. Allen Family Foundation (12171)
  • Templeton World Charity Foundation (TWCF0089/AB55)
  • National Science Foundation (CBET-0939511)
Topics
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Neural dynamics and brain function
  • Life Sciences › Agricultural and Biological Sciences › Plant Science › Plant and Biological Electrophysiology Studies
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
Keywords
bioelectric signaling, electrodiffusion, channel gating, logic gates, pattern detection, regenerative medicine, synthetic biology, connectionist models, dynamical systems, information theory, basal cognition, tissue plasticity
MeSH terms
Algorithms, Animals, Biomedical Engineering, Computer Simulation, Models, Biological, Pattern Recognition, Automated, Planarians, Programming Languages, Regeneration, Signal Transduction, Developmental Biology, Computational Biology, Body Patterning, Regenerative Medicine, Electrophysiological Phenomena, Bioengineering, Synthetic Biology

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Modeling somatic computation with non-neural bioelectric networks. https://app.cochat.ai/papers/10.1038/s41598-019-54859-8
The paper
Manicka, S., & Levin, M. (2019). Modeling somatic computation with non-neural bioelectric networks. Scientific Reports. https://doi.org/10.1038/s41598-019-54859-8

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.