A. Adamatzky, Collision based computing, 2002.
DOI : 10.1007/978-3-540-92910-9_58
URL : https://hal.archives-ouvertes.fr/hal-00461197

F. Becker, M. Chapelle, J. Durand-lose, V. Levorato, and M. Senot, Abstract geometrical computation 8: Small machines, accumulations & rationality, 2013.

L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines, Bulletin of the American Mathematical Society, vol.21, issue.1, pp.1-46, 1989.
DOI : 10.1090/S0273-0979-1989-15750-9

M. Cook, Universality in elementary cellular automata, Complex Systems, vol.15, pp.1-40, 2004.

J. P. Crutchfield, M. Mitchell, and R. Das, The evolutionary design of collective computation in cellular automata, Evolutionary Dynamics?Exploring the Interplay of Selection, Neutrality, Accident, and Function, pp.361-411, 2003.

J. Durand-lose, Reversible space???time simulation of cellular automata, Theoretical Computer Science, vol.246, issue.1-2, pp.117-129, 2000.
DOI : 10.1016/S0304-3975(99)00075-4

J. Durand-lose, Calculer géométriquement sur le plan ? machinesàmachines`machinesà signaux. Habilitationàbilitation`bilitationà Diriger des Recherches

J. Durand-lose, Forcasting black holes in abstract geometrical computation is highly unpredictable Theory and Applications of Models of Computations (TAMC '06), LNCS, issue.3959, pp.644-653, 2006.

J. Durand-lose, Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal, Logical Approaches to Computational Barriers, 2nd Conf. Computability in Europe (CiE '06, pp.163-172, 2006.
DOI : 10.1007/3-540-10003-2_104
URL : https://hal.archives-ouvertes.fr/hal-00079687

J. Durand-lose, Abstract Geometrical Computation and the Linear??Blum, Shub and Smale Model, Computation and Logic in the Real World, 3rd Conf. Computability in Europe (CiE '07, pp.238-247, 2007.
DOI : 10.1007/978-3-540-73001-9_25
URL : https://hal.archives-ouvertes.fr/hal-00144173

J. Durand-lose, Abstract geometrical computation 4: Small Turing universal signal machines, Theoretical Computer Science, vol.412, issue.1-2, pp.57-67, 2011.
DOI : 10.1016/j.tcs.2010.07.013
URL : https://hal.archives-ouvertes.fr/hal-00504876

J. Durand-lose, P. Bonizzoni, V. Brattka, and B. Löwe, Irrationality is needed to compute with signal machines with only three speeds CiE '13, The Nature of Computation, No. LNCS, vol.7921, pp.108-119, 2013.

P. C. Fischer, Generation of Primes by a One-Dimensional Real-Time Iterative Array, Journal of the ACM, vol.12, issue.3, pp.388-394, 1965.
DOI : 10.1145/321281.321290

E. Goto, J¯ oh¯ okagaku eno michi [The Road to information science, pp.67-92, 1966.

J. Mazoyer and I. Rapaport, Inducing an order on cellular automata by a grouping operation, 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS '98). LNCS, pp.116-127, 1998.

J. Mazoyer and V. Terrier, Signals in one-dimensional cellular automata, Theoretical Computer Science, vol.217, issue.1, pp.53-80, 1999.
DOI : 10.1016/S0304-3975(98)00150-9

J. V. Neumann, Theory of Self-Reproducing Automata, 1966.

N. Ollinger and G. Richard, Four states are enough! Theoret, Comp. Sci, vol.41212, pp.22-32, 2011.
DOI : 10.1016/j.tcs.2010.08.018
URL : http://doi.org/10.1016/j.tcs.2010.08.018

G. Richard, Systèmes de particules et collisions discrètes dans les automates cellulaires, 2008.

J. B. Yunès, Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution, Machine, Computations and Universality (MCU '07, pp.316-324, 2007.
DOI : 10.1007/978-3-540-74593-8_27