Natural Computing

, Volume 12, Issue 2, pp 291–303

Turing patterns with Turing machines: emergence and low-level structure formation


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


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.


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

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Behavioural and Evolutionary Theory Lab, Department of Computer ScienceThe University of SheffieldSheffieldUK