Physarum machine: Implementation of a Kolmogorov-Uspensky machine on a biological substrate

Parallel Processing Letters

Volumn 17, Issue 4, 2007, Pages 455-467

  Adamatzky, Andrew ^a  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

Nature inspired computing; Plasmodium; Theory of algorithms; Theory of computation

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; NATURAL SCIENCES COMPUTING;

KOLMOGOROV-USPENSKY MACHINE; NATURE INSPIRED COMPUTING; PLASMODIUM;

PARALLEL PROCESSING SYSTEMS;

EID: 37849016849     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626407003150     Document Type: Article

References (41)

1. Adamatzky A., Computing in non-linear media and automata collectives, IoP Publishing, 2001.
2. Adamatzky A. (Ed.) Collision-Based Computing, Springer, 2003.
3. Adamatzky A., De Lacy Costello B., Asai T. Reaction-Diffusion Computers, Elsevier, 2005.
4. Adamatzky A. and Teuscher C. From Utopian to Genuine Unconventional Computers (Luniver Press, 2006).
5. Adamatzky A. Physarum machines: encapsulating reaction-diffusion to compute spanning tree (2006), submitted.
6. Alber J., Dorn F., Niedermeier R., Experiments on Optimally Solving NP-complete Problems on Planar Graphs, Manuscript (2001), http://www.ii.uib.no/- frederic/ADN01.ps
7. Aono, M., and Gunji, Y.-P., Resolution of infinite-loop in hyperincursive and nonlocal cellular automata: Introduction to slime mold computing. Computing Anticiaptory Systems, AIP Conference Proceedings, 718 (2001) 177-187.
8. Aono, M., and Gunji, Y.-P., Material implementation of hyper-incursive field on slime mold computer. Computing Anticiaptory Systems, AIP Conference Proceedings, 718 (2004) 188-203.
9. Bardzin's J. M. On universality problems in theory of growing automata, Doklady Akademii Nauk SSSR 157 (1964) 542-545.
10. Barzdin' J.M. and Kalnins J. A universal automaton with variable structure, Automatic Control and Computing Sciences 8 (1974) 6-12.
11. Blass A. and Gurevich Y. Algorithms: a quest for absolute definitions, Bull. Europ. Assoc.TCS 81 (2003) 195-225.
12. van Emde Boas, P. Space measures for storage modification machines. Information Process. Lett. 30 (1989) 103-110.
13. Calude C.S., Dinneen M.J., Paun G., Rozenberg G., Stepney S. Unconventional Computation: 5th International Conference, Springer, 2006.
14. 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 (2005) 1-16.
15. Cloteaux B. and Rajan D. Some separation results between classes of pointer algorithms, In DCFS '06: Proceedings of the Eighth Workshop on Descriptional Complexity of Formal Systems. 2006, 232-240.
16. Dexter S., Doyle P. and Gurevich Yu. Gurevich abstract state machines and Schönhage storage modification machines, J Universal Computer Science 3 (1997) 279-303.
17. Dijkstra E.A. A note on two problems in connection with graphs Numer. Math. 1 (1959) 269-271.
18. Gacs P. and Leving L. A. Casual nets or what is a deterministic computation, STANCS-80-768, 1980.
19. Grigoriev D. Kolmogorov algorithms are stronger than Turing machines. Notes of Scientific Seminars of LOMI 60 (1976) 29-37, in Russian. English translation in J. Soviet Math. 14 (1980) 5 1445-1450.
20. Gurevich Y., On Kolmogorov machines and related issues, in Bull. EATCS 35 (1988) 71 - 82.
21. Kamiya N. The protoplasmic flow in the myxomycete Plasmodium as revealed by a volumetric analysis, Protoplasma 39 (1950) 3.
22. Kirkpatrick D.G. and Radke J.D. A framework for computational morphology. In: Toussaint G. T., Ed., Computational Geometry (North-Holland, 1985) 217-248.
23. Knuth D. E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, Reading, Mass. 1968.
24. Kolmogorov A. N., On the concept of algorithm, Uspekhi Mat. Nauk 8:4 (1953), 175-176.
25. Kolmogorov A. N., Uspensky V. A. On the definition of an algorithm. Uspekhi Mat. Nauk, 13 (1958) 3-28, in Russian. English translation: ASM Translations 21 (1963) 2 217-245.
26. Nakagakia T., Yamada H., Ueda T. Interaction between cell shape and contraction pattern in the Physarum Plasmodium, Biophysical Chemistry 84 (2000) 195-204.
27. Nakagaki T., Smart behavior of true slime mold in a labyrinth. Research in Microbiology 152 (2001) 767-770.
28. Nakagaki T., Yamada H., and Toth A., Maze-solving by an amoeboid organism. Nature 407 (2000) 470-470.
29. Nakagaki T., Yamada H., and Toth A., Path finding by tube morphogenesis in an amoeboid organism. Biophysical Chemistry 92 (2001) 47-52.
30. Schönhage A. Real-time simulation of multi-dimensional Turing machines by storage modification machines, Project MAC Technical Memorandum 37, MIT (1973).
31. Schönhage, A. Storage modification machines. SIAM J. Comp., 9 (1980) 490-508.
32. 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 (2001) 1646-9.
33. Shirakawa T. Private communication, Feb 2007.
34. Shvachko K.V. Different modifications of pointer machines and their computational power. In: Proc. Symp. Mathematical Foundations of Computer Science MFCS 1991, 426-435 (LNCS 520).
35. Tarjan R. E. Reference machines require non-linear time to maintain disjoint sets, STAN-CS-77-603, March 1977.
36. 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 (2005) 125-135.
37. Teuscher C. and Adamatzky A. (Eds.) Unconventional Computing 2005: From Cellular Automata to Wetware (Luniver Press, 2005).
38. Tirosh R., Oplatka A., Chet I. Motility in a "cell sap" of the slime mold Physarum Polycephalum, FEBS Letters 34 (1973) 40-42.
39. Tsuda, S., Aono, M., and Gunji, Y.-P., Robust and emergent Physarum-computing. BioSystems 73 (2004) 45-55.
40. Tsuda, S., Zauner, K. P. and Gunji, Y. P., Robot Control: From Silicon Circuitry to Cells, In: Ijspeert, A. J., Masuzawa, T. and Kusumoto, S., Eds. Biologically Inspired Approaches to Advanced Information Technology, Springer, 2006, 20-32.
41. Uspensky V. A. Kolmogorov and mathematical logic, The Journal of Symbolic Logic 57 (1992) 385-412.