arXiv · 0711.2711
Universal computation with limited resources: Belousov-Zhabotinsky and Physarum computers
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.
Explore related subjects
Keep this discovery
Andrew Adamatzky, Ben De Lacy Costello, Tomohiro Shirakawa. 2007-11-17. Universal computation with limited resources: Belousov-Zhabotinsky and Physarum computers. https://doi.org/10.1142/s0218127408021750
Cite the original work for its findings. Save a collection to share your selection of sources.