Turing patterns with Turing machines: emergence and low-level structure formation
From MaRDI portal
Abstract: Despite having advanced a reaction-diffusion model of ODE's in his 1952 paper on morphogenesis, reflecting his interest in mathematical biology, Alan 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.
Recommendations
- Turing and morphogenesis
- The Turing model for biological pattern formation
- After 1952: the later development of Alan Turing's ideas on the mathematics of pattern formation
- Mechanism generating spatial patterns in reaction-diffusion systems
- The mathematical beauty of nature and Turing pattern formation
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3957014 (Why is no real title available?)
- scientific article; zbMATH DE number 1911266 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Algorithmic randomness and complexity.
- Complexities for generalized models of self-assembly
- Compression-based investigation of the dynamical properties of cellular automata and other systems
- Elements of Information Theory
- Emergence as a computability-theoretic phenomenon
- Metaphysics, metamathematics and metabiology
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- On the Length of Programs for Computing Finite Binary Sequences
- PHENOMENOLOGY OF REACTION–DIFFUSION BINARY-STATE CELLULAR AUTOMATA
- Running time and program size for self-assembled squares
- Small Weakly Universal Turing Machines
- The chemical basis of morphogenesis
- The miraculous universal distribution
- The program-size complexity of self-assembled squares (extended abstract)
- Uniform attractor for non-autonomous plate equation with a localized damping and a critical nonlinearity
- Universality in elementary cellular automata
Cited in
(7)- scientific article; zbMATH DE number 5380414 (Why is no real title available?)
- Designing complex dynamics in cellular automata with memory
- Executable modeling of morphogenesis: A Turing-inspired approach
- A circuit basis for morphogenesis
- Turing and morphogenesis
- Bacteria, Turing machines and hyperbolic cellular automata
- From Turing machine to morphogenesis: forming and informing computation
This page was built for publication: Turing patterns with Turing machines: emergence and low-level structure formation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256719)
