Book Chapter10.1007/978-3-540-74593-8_1
Encapsulating reaction-diffusion computers
Andrew Adamatzky
- 10 Sep 2007
- pp 1-11
7
TL;DR: This work increases applicability domain of the reaction-diffusion computers by encapsulating them in a membrane, in a form of vegetative state, plasmodium, of true slime mold, so that they can also realize Kolmogorov-Uspensky machine.
read more
Abstract: Reaction-diffusion computers employ propagation of chemical and excitation waves to transmit information; they use collisions between traveling wave-fronts to perform computation. We increase applicability domain of the reaction-diffusion computers by encapsulating them in a membrane, in a form of vegetative state, plasmodium, of true slime mold. In such form reaction-diffusion computers can also realize Kolmogorov-Uspensky machine.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Biologically inspired approaches to advanced information technology : Second International Workshop, BioADIT 2006, Osaka, Japan, January 26-27, 2006, proceedings
BioADIT,Auke Jan Ijspeert,利光 増澤,Shinji Kusumoto +3 more
- 01 Jan 2006
TL;DR: Biologically Inspired Adaptive Routing by Mimicking Enzymic Feedback Control Mechanism in the Cell and Evaluation of Fundamental Characteristics of Information Systems Based on Photonic DNA Computing.
68
A cellular automata bioinspired algorithm designing data trees in wireless sensor networks
TL;DR: This paper presents a bioinspired, cellular automata (CA) based model for constructing data trees that connect all nodes with a sink node that takes into consideration not only the proximity between two nodes but also their remaining available energy.
18
Towards Physarum engines
TL;DR: The slime mold Physarum polycephalum is a suitable candidate organism for soft-matter robotics because it exhibits controllable transport, movement and guidance behavior as discussed by the authors. But it is not suitable for exploring the generation and distribution of micro-actuation in individual units or planar arrays.
Structural machines and slime mould computation
Mark Burgin,Andrew Adamatzky +1 more
TL;DR: The goal of this paper is to advance formalism of Physarum machines providing theoretical tools for exploration of possibilities of these machines and extension of their applications.
•Proceedings Article
Anti-Platonic Logic and Mathematics.
Andrew Schumann
- 01 Jan 2013
TL;DR: It is shown that the authors can absolutely eliminate notions of apriority (axioms, theorems) in symbolic logic and mathematics and build up formal theories using only notions of Aposteriority.
2
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Maze-solving by an amoeboid organism
TL;DR: It is shown that this simple organism has the ability to find the minimum-length solution between two points in a labyrinth.
A Framework for Computational Morphology
David G. Kirkpatrick,John Radke +1 more
TL;DR: In this paper, a new methodology for describing the internal structure of planar point sets is proposed, which is based on parameterized measures of neighbourliness and gives rise to a spectrum of possible internal shapes.
345
Interaction between cell shape and contraction pattern in the Physarum plasmodium.
TL;DR: The vein organization of the cell interacts with the contractile activity to form a feedback loop in a mechanism of contraction pattern formation in the large amoeboid organism Physarum polycephalum.
201
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
TL;DR: Sous l'hypothese que trois points d'entree ne forment pas un triangle isocele, le RNG de n points dans un espace dimension r peut etre trouve en un temps O(n 2 ) pour r≥3.
192