Turing patterns with Turing machines: emergence and low-level structure formation Article First Online: 16 February 2013 DOI :
10.1007/s11047-013-9363-z

Cite this article as: Zenil, H. Nat Comput (2013) 12: 291. doi:10.1007/s11047-013-9363-z
1
Citations
243
Downloads
Abstract Despite having advanced a reaction–diffusion model of ordinary differential equations in his 1952 paper on morphogenesis, reflecting his interest in mathematical biology, Turing has never been considered to have approached a definition of cellular automata. However, his treatment of morphogenesis, and in particular a difficulty he identified relating to the uneven distribution of certain forms as a result of symmetry breaking, are key to connecting his theory of universal computation with his theory of biological pattern formation. Making such a connection would not overcome the particular difficulty that Turing was concerned about, which has in any case been resolved in biology. But instead the approach developed here captures Turing’s initial concern and provides a low-level solution to a more general question by way of the concept of algorithmic probability, thus bridging two of his most important contributions to science: Turing pattern formation and universal computation. I will provide experimental results of one-dimensional patterns using this approach, with no loss of generality to a n -dimensional pattern generalisation.

Keywords Morphogenesis Pattern formation Turing universality Algorithmic probability Levin–Chaitin coding theorem Mathematics of emergence

References Adamatzky A, Juárez Martínez G, Seck Tuoh Mora JC (2006) Phenomenology of reaction–diffusion binary-state cellular automata. Int J Bifurc Chaos 16(10):2985–3005

MATH CrossRef Google Scholar Adleman LM (2000) Toward a mathematical theory of self-assembly. USC Tech Report

Adleman LM, Cheng Q, Goel A, Huang M-DA (2001) Running time and pro-gram size for self-assembled squares. In: ACM symposium on theory of computing, pp 740–748

Aggarwal G, Goldwasser M, Kao M, Schweller RT (2004) Complexities for generalized models of self-assembly. In: Symposium on discrete algorithms

Barricelli NA (1961) Numerical testing of evolution theories. Part I. Theoretical introduction and basic tests. Acta Biotheor 16(1–2):69–98

Google Scholar Belousov BP (1959) A periodic reaction and its mechanism. In: Collection of short papers on radiation medicine. Med. Publ., Moscow

Brenner S (2012) Turing centenary: life’s code script. Nature 482(7386):461

CrossRef Google Scholar Calude CS (2002) Information and randomness: an algorithmic perspective. Springer, Berlin

MATH CrossRef Google Scholar Chaitin GJ (1969) On the length of programs for computing finite binary sequences: statistical considerations. J ACM 16(1):145–159

MathSciNet MATH CrossRef Google Scholar Chaitin GJ (2011) Metaphysics, metamathematics and metabiology. In: Zenil H (ed) Randomness through computation. World Scientific, Singapore City, pp 93–103

CrossRef Google Scholar Chaitin GJ (2012) Life as evolving software. In: Zenil H (ed) A computable universe. World Scientific, Singapore City

Cook M (2004) Universality in elementary cellular automata. Complex Syst 15:1–40

MATH Google Scholar Cooper SB (2009) Emergence as a computability theoretic phenomenon. Appl Math Comput 215:1351–1360

MathSciNet MATH CrossRef Google Scholar Cover TM, Thomas JA (2006) Elements of information theory. Wiley, New York

MATH Google Scholar Delahaye J.P., Zenil H. (2012) Numerical evaluation of the complexity of short strings: a glance into the innermost structure of algorithmic randomness. Appl Math Comput 219:63–77

CrossRef Google Scholar Dennett DC (1996) Darwin’s dangerous idea: evolution and the meanings of life. Simon & Schuster, New York

Google Scholar Dingle K, Zenil H, Marshall JAR, Louis AA (submitted) Robustness and simplicity bias in genotype–phenotype maps

Downey R, Hirschfeldt DR (2010) Algorithmic randomness and complexity. Springer, Berlin

MATH CrossRef Google Scholar Dyson G (1999) Darwin among the machines, New edition. Penguin Books Ltd, London

Google Scholar Gardner M (1970) Mathematical games—the fantastic combinations of John Conway’s new solitaire game “life”. Sci Am 223:120–123

CrossRef Google Scholar Grafen A (2007) The formal Darwinism project: a mid-term report. J Evol Biol 20:1243–1254

CrossRef Google Scholar Grafen A (2008) The simplest formal argument for fitness optimization. J Genet 87(4):1243–1254

MathSciNet CrossRef Google Scholar Hopfield JJ (1999) Brain, neural networks, and computation. Rev Mod Phys 71:431–437

CrossRef Google Scholar Joosten J., Soler-Toscano F., Zenil H. (2011) Program-size versus time complexity, speed-up and slowdown phenomena in small Turing machines. Int J Unconv Comput Spec Issue Phys Comput 7:353–387

Google Scholar Kirchherr W, Li M, Vitányi P (1997) The miraculous universal distribution. Math Intell 19(4):7–15

Google Scholar Koch AJ, Meinhardt H (1994) Biological pattern formation: from basic mechanisms to complex structures. Rev Mod Phys 66:1481–1507

CrossRef Google Scholar Kolmogorov AN (1965) Three approaches to the quantitative definition of information. Probl Inf Transm 1(1):1–7

MathSciNet Google Scholar Langton CG (1986) Studying artificial life with cellular automata. Physica D 22(1–3):120–149

MathSciNet CrossRef Google Scholar Lawrence PA (2001) Morphogens: how big is the big picture? Nat Cell Biol 3:E151–E154

CrossRef Google Scholar Levin L (1974) Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Probl Inf Transm 10:206–210

Google Scholar Maini PK, Baker RE, Chuong CM (2006) Developmental biology. The Turing model comes of molecular age. Science 314(5804):1397–1398

CrossRef Google Scholar Meierhenrich U (2008) Amino acids and the asymmetry of life. Advances in astrobiology and biogeophysics. Springer, Berlin

Google Scholar Meinhardt H (1992) Models of Biological Pattern Formation: common mechanism in plant and animal development. Int J Dev Biol 40:123–134

Google Scholar Minsky ML (1967) Computation: finite and infinite machines. Prentice Hall, Englewood Cliffs

MATH Google Scholar Mitchell M (2011) What is meant by “Biological Computation”? ACM Commun Ubiquity 2011:1–7

Google Scholar Neary T, Woods D (2009) Small weakly universal Turing machines. In: 17th International symposium on fundamentals of computation theory (FCT 2009), vol 5699 of LNCS, pp 262–273, Wroclaw, Poland. Springer, Berlin

Reed J, Toombs R, Barricelli NA (1967) Simulation of biological evolution and machine learning: I. Selection of self-reproducing numeric patterns by data processing machines, effects of hereditary control, mutation type and crossing. J Theor Biol 17(3):319–342

CrossRef Google Scholar Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: ACM symposium on theory of computing, pp 459–468

Rothemund PWK, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol 2(12):e424. doi:

10.1371/journal.pbio.0020424
Shetty RP, Endy D, Knight Jr TF (2008) Engineering BioBrick vectors from BioBrick parts. J Biol Eng 2:5

CrossRef Google Scholar Solomonoff R (1960) A preliminary report on a general theory of inductive inference. (Revision of Report V-131), Contract AF 49(639)-376, Report ZTB-138, November. Zator Co., Cambridge

Turing AM (1936) On computable numbers, with an application to the Entscheidungs problem. Proc Lond Math Soc 2 42:230–265 (published in 1937)

Google Scholar Turing AM (1952) The chemical basis of morphogenesis. Philos Trans R Soc Lond B 237(641):37–72

CrossRef Google Scholar Ulam S (1986) Science, computers, and people. Birkhauser, Boston

MATH CrossRef Google Scholar von Neumann J (1966) In: Burks A (ed) The theory of self-reproducing automata. University of Illinois Press, Urbana

Google Scholar Watson JD, Crick FHC (1953) A structure for deoxyribose nucleic acid. Nature 171(4356):737–738

CrossRef Google Scholar Winfree E (1998a) Algorithmic self-assembly of DNA. Thesis in partial fulfillment of the requirements for the Degree of Doctor of Philosophy, Caltech

Winfree E (1998b) Simulations of computing by self-assembly. Technical Report CS-TR:1998.22. Caltech

Wolfram S (2002) A new kind of science. Wolfram Media, Champaign, IL

MATH Google Scholar Wolfram S (2012) The mechanisms of biology—why Turing hadn’t thought of using his machines for biological systems. In: Cooper SB, van Leeuwen J (eds) Forthcoming in Alan Turing—his work and impact. Wolfram Media, Champaign, IL

Young DA (1984) A local activator–inhibitor model of vertebrate skin patterns. Math Biosci 72:51–58

MathSciNet CrossRef Google Scholar Zammataro L Idealized Belousov–Zhabotinsky reaction from the Wolfram Demonstrations Project.

http://demonstrations.wolfram.com/IdealizedBelousovZhabotinskyReaction/ . Accessed 10 July 2012

Zenil H (2010) Compression-based investigation of the dynamical properties of cellular automata and other systems. Complex Syst 19(1):1–28

MathSciNet MATH Google Scholar Zenil H, Delahaye JP (2010) On the algorithmic nature of the world. In: Dodig-Crnkovic G, Burgin M (eds) Information and computation. World Scientific, Singapore City

Google Scholar Zenil H, Marshall JAR (2012) Some aspects of computation essential to evolution and life, ubiquity, “Evolutionary Computation and the Processes of Life”. Ubiquity 2012(Sep), Article no. 11

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations 1. Behavioural and Evolutionary Theory Lab, Department of Computer Science The University of Sheffield Sheffield UK