From reaction-diffusion to physarum computing

DOI10.1007/s11047-009-9120-5zbMath1192.68270MaRDI QIDQ734218

Andrew Adamatzky

Publication date: 19 October 2009

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-009-9120-5

zbMATH Keywords

Spanning trees; Biological computing; Computational universality; Reaction-diffusion computing

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

Related Items

The nature of the extended analog computer

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Dispersion relation in oscillatory reaction-diffusion systems with self-consistent flow in true slime mold
• Programmable reconfiguration of Physarum machines
• Three-valued logic gates in reaction-diffusion excitable media
• A coupled-oscillator model with a conservation law for the rhythmic amoeboid movements of plasmodial slime molds
• Growing spanning trees in plasmodium machines
• Storage Modification Machines
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Kolmogorov and mathematical logic
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item