A biologically and physically plausible model for ants and pheromones is proposed. It is argued that the mechanisms described in this model are sufficiently powerful to reproduce the necessary components of universal computation. The claim is supported by illustrating the feasibility of designing arbitrary logic circuits, showing that the interactions of ants and pheromones lead to the expected behavior, and presenting computer simulation results to verify the circuits' working. The conclusions of this study can be taken as evidence that coherent deterministic and centralized computation can emerge from the collective behavior of simple distributed Markovian processes such as those followed by biological ants, but also, more generally, by artificial agents with limited computational and communication abilities.
[1]
Toshinori Munakata,et al.
Flow resistance for microfluidic logic operations
,
2004
.
[2]
Chris Hanson,et al.
Amorphous computing
,
2000,
Commun. ACM.
[3]
Thomas Stützle,et al.
Ant Colony Optimization Theory
,
2004
.
[4]
E. Bonabeau,et al.
Fixed response thresholds and the regulation of division of labor in insect societies
,
1998
.
[5]
Baldo Faieta,et al.
Diversity and adaptation in populations of clustering ants
,
1994
.
[6]
Jean-Louis Deneubourg,et al.
The dynamics of collective sorting robot-like ants and ant-like robots
,
1991
.
[7]
J. Deneubourg,et al.
The self-organizing exploratory pattern of the argentine ant
,
1990,
Journal of Insect Behavior.
[8]
Gerald Jay Sussman,et al.
Cellular Gate Technology
,
1998
.