Skip to main content
SpringerLink
Log in
Book cover

International Conference on Machines, Computations, and Universality

MCU 2007: Machines, Computations, and Universality pp 1–11Cite as

Encapsulating Reaction-Diffusion Computers

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4664))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamatzky, A.: Neural algorithm for constructing minimal spanning tree. Neural Network World 6, 335–339 (1991)

    Google Scholar 

  2. Adamatzky, A.: Computing in non-linear media and automata collectives. IoP, Bristol (2001)

    Google Scholar 

  3. Adamatzky, A. (ed.): Collision-Based Computing. Springer, Heidelberg (2003)

    Google Scholar 

  4. Adamatzky, A., De Lacy Costello, B., Asai, T.: Reaction-Diffusion Computers. Elsevier, Amsterdam (2005)

    Google Scholar 

  5. Adamatzky, A., Teuscher, C.: From Utopian to Genuine Unconventional Computers. Luniver Press (2006)

    Google Scholar 

  6. Adamatzky, A.: Physarum machines: encapsulating reaction-diffusion to compute spanning tree (submitted)

    Google Scholar 

  7. Adamatzky, A.: Physarum machine: implementation of Kolmogorov-Uspensky machine in biological substrate. Parallel Processing Letters (in press, 2007)

    Google Scholar 

  8. Adamatzky, A.: Growing spanning trees in plasmodium machines, Kybernetes (in press, 2007)

    Google Scholar 

  9. Alber, J., Dornm, F., Niedermeier, R.: Experiments on Optimally Solving NP-complete Problems on Planar Graphs (Manuscript, 2001), http://www.ii.uib.no/~frederic/ADN01.ps

  10. Aono, M., Gunji, Y.-P.: Resolution of infinite-loop in hyperincursive and nonlocal cellular automata: Introduction to slime mold computing. In: Computing Anticiaptory Systems. AIP Conference Proceedings, vol. 718, pp. 177–187 (2001)

    Google Scholar 

  11. Aono, M., Gunji, Y.-P.: Material implementation of hyper-incursive field on slime mold computer. In: Computing Anticiaptory Systems. AIP Conference Proceedings, vol. 718, pp. 188–203 (2004)

    Google Scholar 

  12. Bardzin’s, J.M.: On universality problems in theory of growing automata. Doklady Akademii Nauk SSSR 157, 542–545 (1964)

    MathSciNet  Google Scholar 

  13. Barzdin’, J.M., Kalnins, J.: A universal automaton with variable structure. Automatic Control and Computing Sciences 8, 6–12 (1974)

    Google Scholar 

  14. Blass, A., Gurevich, Y.: Algorithms: a quest for absolute definitions. Bull. Europ. Assoc.TCS 81, 195–225 (2003)

    MathSciNet  Google Scholar 

  15. van Emde Boas, P.: Space measures for storage modification machines. Information Process. Lett. 30, 103–110 (1989)

    Article  MATH  Google Scholar 

  16. Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S.: UC 2006. LNCS, vol. 4135. Springer, Heidelberg (2006)

    Book  MATH  Google Scholar 

  17. Cartigny, J., Ingelrest, F., Simplot-Ryl, D., Stojmenovic, I.: Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks. Ad Hoc Networks 3, 1–16 (2005)

    Article  Google Scholar 

  18. Cloteaux, B., Rajan, D.: Some separation results between classes of pointer algorithms. In: DCFS 2006: Proceedings of the Eighth Workshop on Descriptional Complexity of Formal Systems, pp. 232–240 (2006)

    Google Scholar 

  19. Dexter, S., Doyle, P., Gurevich, Y.: Gurevich abstract state machines and Schönhage storage modification machines. J. Universal Computer Science 3, 279–303 (1997)

    MATH  MathSciNet  Google Scholar 

  20. Dijkstra, E.A.: A note on two problems in connection with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  21. Gacs, P., Leving, L.A.: Casual nets or what is a deterministic computation, STAN-CS-80-768 (1980)

    Google Scholar 

  22. Grigoriev, D.: Kolmogorov algorithms are stronger than Turing machines. Notes of Scientific Seminars of LOMI (in Russian) 60, 29–37 (1976) (English translation in J. Soviet Math. 14(5) 1445–1450 (1980))

    Google Scholar 

  23. Gurevich, Y.: On Kolmogorov machines and related issues. Bull. EATCS 35, 71–82 (1988)

    Google Scholar 

  24. Jaromczyk, J.W., Kowaluk, M.: A note on relative neighborhood graphs. In: Proc. 3rd Ann. Symp. Computational Geometry, pp. 233–241 (1987)

    Google Scholar 

  25. Kamiya, N.: The protoplasmic flow in the myxomycete plasmodium as revealed by a volumetric analysis. Protoplasma 39, 3 (1950)

    Article  Google Scholar 

  26. Kirkpatrick, D.G., Radke, J.D.: A framework for computational morphology. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 217–248. North-Holland, Amsterdam (1985)

    Google Scholar 

  27. Knuth, D.E.: The Art of Computer Programming. Fundamental Algorithms, vol. 1. Addison-Wesley, Reading, Mass (1968)

    MATH  Google Scholar 

  28. Kolmogorov, A.N.: On the concept of algorithm. Uspekhi Mat. Nauk 8(4), 175–176 (1953)

    MATH  Google Scholar 

  29. Kolmogorov, A.N., Uspensky, V.A.: On the definition of an algorithm. Uspekhi Mat. Nauk (in Russian), 13, 3–28 (1958) (English translation: ASM Translations 21(2), 217–245 (1963))

    Google Scholar 

  30. Nakagakia, T., Yamada, H., Ueda, T.: Interaction between cell shape and contraction pattern in the Physarum plasmodium. Biophysical Chemistry 84, 195–204 (2000)

    Article  Google Scholar 

  31. Nakagaki, T.: Smart behavior of true slime mold in a labyrinth. Research in Microbiology 152, 767–770 (2001)

    Article  Google Scholar 

  32. Nakagaki, T., Yamada, H., Toth, A.: Maze-solving by an amoeboid organism. Nature 407, 470 (2000)

    Article  Google Scholar 

  33. Nakagaki, T., Yamada, H., Toth, A.: Path finding by tube morphogenesis in an amoeboid organism. Biophysical Chemistry 92, 47–52 (2001)

    Article  Google Scholar 

  34. Schönhage, A.: Real-time simulation of multi-dimensional Turing machines by storage modification machines. Project MAC Technical Memorandum, vol. 37. MIT, Cambridge (1973)

    Google Scholar 

  35. Schönhage, A.: Storage modification machines. SIAM J. Comp. 9, 490–508 (1980)

    Article  MATH  Google Scholar 

  36. Sedina-Nadal, I., Mihaliuk, E., Wang, J., Perez-Munuzuri, V., Showalter, K.: Wave propagation in subexcitable media with periodically modulated excitability. Phys. Rev. Lett. 86, 1646–1649 (2001)

    Article  Google Scholar 

  37. Shirakawa, T.: Private communication (February 2007)

    Google Scholar 

  38. Shvachko, K.V.: Different modifications of pointer machines and their computational power. In: Tarlecki, A. (ed.) Mathematical Foundations of Computer Science 1991. LNCS, vol. 520, pp. 426–435. Springer, Heidelberg (1991)

    Google Scholar 

  39. Steinbock, O., Tóth, A., Showalter, K.: Navigating complex labyrinths: optimal paths from chemical waves. Science 267, 868–871 (1995)

    Article  Google Scholar 

  40. Supowit, K.J.: The relative neighbourhood graph, with application to minimum spanning tree. J. ACM 30, 428–448 (1988)

    Article  MathSciNet  Google Scholar 

  41. Tarjan, R.E.: Reference machines require non-linear time to maintain disjoint sets, STAN-CS-77-603 (March 1977)

    Google Scholar 

  42. Tero, A., Kobayashi, R., Nakagaki, T.: A coupled-oscillator model with a conservation law for the rhythmic amoeboid movements of plasmodial slime molds. Physica D 205, 125–135 (2005)

    Article  MATH  Google Scholar 

  43. Teuscher, C., Adamatzky, A. (eds.): Unconventional Computing 2005: From Cellular Automata to Wetware. Luniver Press (2005)

    Google Scholar 

  44. Tirosh, R., Oplatka, A., Chet, I.: Motility in a “cell sap” of the slime mold Physarum Polycephalum. FEBS Letters 34, 40–42 (1973)

    Article  Google Scholar 

  45. Tsuda, S., Aono, M., Gunji, Y.-P.: Robust and emergent Physarum-computing. BioSystems 73, 45–55 (2004)

    Article  Google Scholar 

  46. Tsuda, S., Zauner, K.P., Gunji, Y.P.: Robot Control: From Silicon Circuitry to Cells. In: Ijspeert, A.J., Masuzawa, T., Kusumoto, S. (eds.) BioADIT 2006. LNCS, vol. 3853, pp. 20–32. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  47. Uspensky, V.A.: Kolmogorov and mathematical logic. The Journal of Symbolic Logic 57, 385–412 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  48. Yamada, H., Nakagaki, T., Baker, R.E., Maini, P.K.: Dispersion relation in oscillatory reaction-diffusion systems with self-consistent flow in true slime mold. J. Math. Biol. (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol BS16 1QY, United Kingdom

    Andrew Adamatzky

Authors
  1. Andrew Adamatzky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jérôme Durand-Lose Maurice Margenstern

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adamatzky, A. (2007). Encapsulating Reaction-Diffusion Computers. In: Durand-Lose, J., Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74593-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74593-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74592-1

  • Online ISBN: 978-3-540-74593-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation