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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.