On using compressibility to detect when slime mould completed computation
暂无分享,去创建一个
[1] Andrew Adamatzky,et al. Towards slime mould colour sensor: Recognition of colours by Physarum polycephalum , 2013, ArXiv.
[2] José María Amigó,et al. Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity , 2004, Neural Computation.
[3] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[4] Andrew Adamatzky,et al. Slime Mold Solves Maze in One Pass, Assisted by Gradient of Chemo-Attractants , 2011, IEEE Transactions on NanoBioscience.
[5] Andrew Schumann,et al. Logical Modelling of Physarum Polycephalum , 2011, ArXiv.
[6] Andrew Adamatzky,et al. Physarum machines: encapsulating reaction–diffusion to compute spanning tree , 2007, Naturwissenschaften.
[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[8] Jeff Jones,et al. From Pattern Formation to Material Computation: Multi-agent Modelling of Physarum Polycephalum , 2015 .
[9] Andrew Adamatzky. The World's colonization and Trade Routes Formation as imitated by slime mould , 2012, Int. J. Bifurc. Chaos.
[10] Jeff Jones,et al. Slime Mould Inspired Generalised Voronoi Diagrams with Repulsive Fields , 2015, ArXiv.
[11] Shigeru Ninagawa,et al. Solving the Parity Problem with Rule 60 in Array Size of the Power of Two , 2013, J. Cell. Autom..
[12] Andrew Adamatzky,et al. EXPRESSIVENESS OF ELEMENTARY CELLULAR AUTOMATA , 2013 .
[13] A. Adamatzky,et al. Classifying elementary cellular automata using compressibility, diversity and sensitivity measures , 2014 .
[14] Genaro Juárez Martínez,et al. Compression-Based Analysis of Cyclic Tag System Emulated by Rule 110 , 2014, J. Cell. Autom..
[15] Andrew Schumann,et al. PHYSARUM SPATIAL LOGIC , 2011 .
[16] Yuriy L. Orlov,et al. Complexity: an internet resource for analysis of DNA sequence complexity , 2004, Nucleic Acids Res..
[17] T. Nakagaki,et al. Smart behavior of true slime mold in a labyrinth. , 2001, Research in microbiology.
[18] Andrew Schumann,et al. Towards an Object-Oriented Programming Language for Physarum Polycephalum Computing , 2013, CS&P.
[19] Hussein Al-Bahadili,et al. A Bit-Level Text Compression Scheme Based on the Hcdc Algorithm , 2010 .
[20] Leon O. Chua,et al. Phenomenology of Retained refractoriness: on Semi-Memristive discrete Media , 2011, Int. J. Bifurc. Chaos.
[21] J. Bhattacharya,et al. Complexity analysis of spontaneous EEG. , 2000, Acta neurobiologiae experimentalis.
[22] Hiroshi Imai,et al. Can General-Purpose Compression Schemes Really Compress DNA Sequences ? , 2000 .
[23] S. Stephenson,et al. Myxomycetes: A Handbook of Slime Molds , 1994 .
[24] Jeff Jones,et al. Characteristics of Pattern Formation and Evolution in Approximations of Physarum Transport Networks , 2010, Artificial Life.
[26] Jeff Jones,et al. The Emergence and Dynamical Evolution of Complex Transport Networks from Simple Low-Level Behaviours , 2015, Int. J. Unconv. Comput..
[27] A. Khokhlov,et al. Conformation-dependent evolution of copolymer sequences. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[28] Andrew Adamatzky,et al. On Diversity of Configurations Generated by Excitable Cellular Automata with Dynamical Excitation Intervals , 2012, 1209.2668.
[29] Genaro Juárez Martínez,et al. On generative morphological diversity of elementary cellular automata , 2010, Kybernetes.
[30] Jaroslav Nesetril,et al. Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history , 2001, Discret. Math..
[31] Andrew Adamatzky,et al. Physarum Machines: Computers from Slime Mould , 2010 .