Abstract
Being a living substrate the slime mould does not halt its behaviour when a task is solved but often continues foraging the space thus masking the solution found. We propose to use temporal changes in compressibility of the slime mould patterns as indicators of the halting of the computation. Compressibility of a pattern characterises the pattern’s morphological diversity, i.e. a number of different local configurations. At the beginning of computation the slime explores the space thus generating less compressible patterns. After gradients of attractants and repellents are detected the slime spans data sites with its protoplasmic network and retracts scouting branches, thus generating more compressible patterns. We analyse the feasibility of the approach on results of laboratory experiments and computer modelling.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aboy, M., Hornero, R., Abásolo, D., Álvarez, D.: Interpretation of the Lempel-Ziv complexity measure in the context of biomedical signal analysis. IEEE Trans. Biomed. Eng. 53(11), 2282–2288 (2006)
Adamatzky, A.: Physarum machines: encapsulating reaction-diffusion to compute spanning tree. Naturwissenschaften 94(12), 975–980 (2007)
Adamatzky, A.: Physarum Machines: Computers from Slime Mould, vol. 74. World Scientific (2010)
Adamatzky, A.: On diversity of configurations generated by excitable cellular automata with dynamical excitation intervals. Int. J. Mod. Phys. C 23(12) (2012)
Adamatzky, A.: Slime mold solves maze in one pass, assisted by gradient of chemo-attractants. IEEE Trans. NanoBiosci. 11(2), 131–134 (2012)
Adamatzky, A.: The world’s colonization and trade routes formation as imitated by slime mould. Int. J. Bifurcat. Chaos 22(08) (2012)
Adamatzky, A., Chua, L.O.: Phenomenology of retained refractoriness: on semi-memristive discrete media. Int. J. Bifurcat. Chaos 22(11) (2012)
Adamatzky, A., Martinez, G.J.: On generative morphological diversity of elementary cellular automata. Kybernetes 39(1), 72–82 (2010)
Al-Bahadili, H., Rababa’a, A.: A bit-level text compression scheme based on the HCDC algorithm. Int. J. Comput. Appl. 32(3), 355 (2010)
Amigó, J.M., Szczepański, J., Wajnryb, E., Sanchez-Vives, M.V.: Estimating the entropy rate of spike trains via Lempel-Ziv complexity. Neural Comput. 16(4), 717–736 (2004)
Bhattacharya, J., et al.: Complexity analysis of spontaneous EEG. Acta Neurobiol. Exp. 60(4), 495–502 (2000)
Feldman, D.P., Crutchfield, J.: A Survey of Complexity Measures, vol. 11. Santa Fe Institute, USA (1998)
Jones, J.: Characteristics of pattern formation and evolution in approximations of Physarum transport networks. Artif. Life 16(2), 127–153 (2010)
Jones, J.: The emergence and dynamical evolution of complex transport networks from simple low-level behaviours. Int. J. Unconventional Comput. 6, 125–144 (2010)
Jones, J.: From Pattern Formation to Material Computation: Multi-agent Modelling of Physarum Polycephalum. Springer, in-press (2015)
Jones, J., Adamatzky, A.: Slime mould inspired generalised Voronoi diagrams with repulsive fields. Int. J. Bifurcat. Chaos (2013) (In-Press)
Khalatur, P.G., Novikov, V.V., Khokhlov, A.R.: Conformation-dependent evolution of copolymer sequences. Phys. Rev. E 67(5):051901 (2003)
Matsumoto, T., Sadakane, K., Imai, H., Okazaki, T.: Can general-purpose compression schemes really compress DNA sequences. Currents Comput. Mol. Biol. 76–77 (2000)
Nešetřil, J., Milková, E., Nešetřilová, H.: Otakar Boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Math. 233(1), 3–36 (2001)
Ninagawa, S.: Solving the parity problem with Rule 60 in array size of the power of two (2013). arXiv:1307.3888
Ninagawa, S., Adamatzky, A.: Classifying elementary cellular automata using compressibility, diversity and sensitivity measures. Int. J. Mod. Phys. C 25(03) (2014)
Ninagawa, S., Martinez, G.J.: Compression-based analysis of cyclic tag system emulated by Rule 110. J. Cell. Automata 9(1):23–35 (2014)
Orlov, Y.L., Potapov, V.N.: Complexity: an internet resource for analysis of DNA sequence complexity. Nucleic Acids Res. 32(suppl 2), W628–W633 (2004)
Preparata, F.P., Shamos, M.L.: Computational Geometry, An introduction. Springer, New York (1985)
Redeker, M., Adamatzky, A., Martínez, G.J.: Expressiveness of elementary cellular automata. Int. J. Mod. Phys. C 24(03) (2013)
Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory 24(5), 530–536 (1978)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Adamatzky, A., Jones, J. (2016). Halting Physarum Machines Based on Compressibility. In: Adamatzky, A. (eds) Advances in Physarum Machines. Emergence, Complexity and Computation, vol 21. Springer, Cham. https://doi.org/10.1007/978-3-319-26662-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-26662-6_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26661-9
Online ISBN: 978-3-319-26662-6
eBook Packages: EngineeringEngineering (R0)