Universal computation with limited resources: Belousov-Zhabotinsky and Physarum computers
Pattern Formation and Solitons
2010-11-23 v1 Adaptation and Self-Organizing Systems
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.
Keywords
Cite
@article{arxiv.0711.2711,
title = {Universal computation with limited resources: Belousov-Zhabotinsky and Physarum computers},
author = {Andrew Adamatzky and Ben De Lacy Costello and Tomohiro Shirakawa},
journal= {arXiv preprint arXiv:0711.2711},
year = {2010}
}
Comments
Int. J. Bifurcation and Chaos (2008), accepted