Universal computation with limited resources: Belousov-Zhabotinsky and Physarum computers
classification
🌊 nlin.PS
nlin.AO
keywords
limitedresourcesbelousov-zhabotinskycomputationlocalizationsmediumphysarumuniversal
read the original abstract
Using the examples of an excitable chemical system (Belousov-Zhabotinsky medium) and plasmodium of Physarum polycephalum we show that universal computation in a geometrically unconstrained medium is only possible when resources (excitability or concentration of nutrients) are limited. In situations of limited resources the systems studied develop travelling localizations. The localizations are elementary units of dynamical logical circuits in collision-based computing architectures.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.