is a computer that can compute any computable function. (Walker, „Origins of life“.)
The evolution law is sufficiently non-trivial to make our cellular automaton behave as a universal computer [37, 61]. (’T Hooft, „Motivation for This Work“.)
~
WALKER, Sara I., 2017. Origins of life: A problem for physics. arXiv preprint arXiv:1705.08073. 2017.
’T HOOFT, Gerard, 2016. Motivation for This Work. In: ’T HOOFT, Gerard, The Cellular Automaton Interpretation of Quantum Mechanics. Online. Cham: Springer International Publishing. p. 3–18. Fundamental Theories of Physics. [Accessed 2 October 2023]. ISBN 978-3-319-41284-9.
37. E. Fredkin, T. Toffoli, Int. J. Theor. Phys. 21, 219 (1982)
61. D.B. Miller, E. Fredkin, Two-state, reversible, universal cellular automata in three dimensions, in Proc. 2nd Conf. on Computing Frontiers, ACM 45, Ischia, Italy (2005). arXiv: nlin/0501022. doi:10.1145/1062271