Advertisement

Computing with a Distributed Reaction-Diffusion Model

  • S. Bandini
  • G. Mauri
  • G. Pavesi
  • C. Simone
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3354)

Abstract

Reaction–diffusion models are commonly used to describe dynamical processes in complex physical, chemical and biological systems. Applications of these models range from pattern formation or epidemic spreads to natural selection through ecological systems and percolation systems. Reaction refers to phenomena where two or more entities become in contact and modify their state as a consequence of this fact. Diffusion implies the existence of a space where the involved entities are situated and can move. The Reaction–Diffusion Machine is a computational model we previously introduced inspired by reaction diffusion phenomena. In this work, we prove that a Deterministic Turing Machine can be simulated by a Reaction-Diffusion Machine.

Keywords

Turing Machine Read Operation Rule Application Computer Support Cooperative Work Reaction Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Turing, A.: The chemical basis of morphogenesis. Philos. Trans. R. Society 237 (1952)Google Scholar
  2. 2.
    Cantrell, R.S., Cosner, C.: Spatial Ecology via Reaction–Diffusion Equations. Wiley, Chichester (2003)zbMATHGoogle Scholar
  3. 3.
    Bandini, S., Mauri, G., Pavesi, G., Simone, C.: A parallel model based on Cellular Automata for the simulation of pesticide percolation in the soil. In: Malyshkin, V.E. (ed.) PaCT 1999. LNCS, vol. 1662, pp. 383–394. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    Simone, C., Bandini, S.: The reaction–diffusion methaphor for modeling cooperative work. Prestige J. of Management and Research 2(1), 1–21 (1998)MathSciNetGoogle Scholar
  5. 5.
    Bandini, S., Simone, C.: Integrating forms of interaction in a distributed model. Fundamenta Informaticae 61(1), 1–17 (2004)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP–Completeness. Freeman and Company, San Francisco (1979)zbMATHGoogle Scholar
  7. 7.
    Boudol, G., Berry, G.: The chemical abstract machine. Theoretical Computer Science 96(1) (1992)Google Scholar
  8. 8.
    Simone, C., Bandini, S.: Integrating awareness in cooperative applications through the reaction–diffusion metaphor. Computer Supported Cooperative Work 11(3-4), 495–530 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • S. Bandini
    • 1
  • G. Mauri
    • 1
  • G. Pavesi
    • 2
  • C. Simone
    • 1
  1. 1.Dept. of Computer Science, Systems and CommunicationUniversity of Milan–BicoccaMilanItaly
  2. 2.Dept. of Computer Science and Communication (D.I.Co)University of MilanMilanItaly

Personalised recommendations