?. and L. Présence, postérieurement) de différentes r` egles et signaux, demanì erè a imposer une « configuration limite initiale », que l'on pourrait « forcer » ` a l'aide d'autres signaux qui seraient incidents sur le côté

. Dans-le-premier-cas, postérieurement, il n'y a plus que des signaux en sortie, nous sommes dans un contexte déterministe. Dans le second cas, le contexte est fortement déterministe. Dans letroisì eme cas, on peut dire qu'il y a création d'un signal de dimension 1

A. B. Singularitéssingularit´singularités, . Non, and . Fig, B.3 ? Ensemble des points des singularités formant un Cantor

A. V. Adamatzkyahu74-]-a, J. E. Aho, and J. Hopcroft, Collision based computing Ullman ? The design and analysis of computer algorithms, 1974.

E. Asarin, Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy, Journal of Computer and System Sciences, vol.57, issue.3, pp.389-398, 1998.
DOI : 10.1006/jcss.1998.1601

R. Büchi and ?. , The monadic second order theory of ? 1 », The monadic second order theory of all countable ordinals, LNCS, issue.328, pp.1-126, 1976.

L. Blum, F. Cucker, and M. , Shub et S. Smale ? Complexity and real computation, 1998.

N. Boccara and J. Nasser, Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules, Physical Review A, vol.44, issue.2, pp.866-875, 1991.
DOI : 10.1103/PhysRevA.44.866

L. Blum and M. Shub, 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

A. Church and ?. Entscheidungsproblem, A note on the Entscheidungsproblem, The Journal of Symbolic Logic, vol.166, issue.01, pp.40-41, 1936.
DOI : 10.1007/BF01475439

M. L. Campagnolo and C. , Moore ? « Upper and lower bounds on continuoustime computation, 2nd International Conference on Unconventional Models of Computation -UMC '2K (I. Antoniou, C. Calude et M. Dinneen, pp.135-153, 2001.

R. [. Cook, Time bounded random access machines, Journal of Computer and System Sciences, vol.7, issue.4, pp.354-375, 1973.
DOI : 10.1016/S0022-0000(73)80029-7
URL : http://doi.org/10.1016/s0022-0000(73)80029-7

M. Delorme and J. Mazoyer, Discrete parabolas and circles on 2D cellular automata, Theoretical Computer Science, vol.218, issue.2, pp.347-417, 1999.
DOI : 10.1016/S0304-3975(98)00330-2
URL : http://doi.org/10.1016/s0304-3975(98)00330-2

M. Davis and R. , Signal et E. Weuber ? Computability, complexity and languages, 1994.

]. E. Got66, ?. Goto, and . Otomaton-ni-kansuru-pazuru, Puzzles on automata] », J¯ oh¯ okagaku eno michi [The Road to Information Science, pp.67-92, 1966.

W. Hordijk, C. R. Shalizi, and J. P. , Upper bound on the products of particle interactions in cellular automata, Physica D: Nonlinear Phenomena, vol.154, issue.3-4, pp.240-258, 2001.
DOI : 10.1016/S0167-2789(01)00252-4

J. [. Hopcroft, Ullman ? Introduction to automata theory, languages, and computation, 1979.
DOI : 10.1145/568438.568455

C. Iwamoto, T. Andou, and K. Morita, Imai ? « Computational complexity in the hyperbolic plane, Symposium on Mathematical Foundations of Computer Science (MFCS '02), pp.365-374, 2002.

. [. Jacopini, Reversible parallel computation: An evolving space-model, Theoretical Computer Science, vol.73, issue.1, pp.1-46, 1990.
DOI : 10.1016/0304-3975(90)90160-J

M. H. Jakubowsky and K. Steiglitz, Squier ? « Computing with solitons: A review and prospectus, pp.277-297, 2002.

J. Kari and ?. , Reversibility of 2D cellular automata is undecidable, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, pp.45-379, 1990.
DOI : 10.1016/0167-2789(90)90195-U

]. S. Kle36a, Kleene ? « General recursive functions of natural numbers, Mathematische Annalen, vol.112, pp.727-742, 1936.

Y. Lecerf and ?. Machines-de-turing-réversibles, Récursive insolubilité en n ? N de l'´ equation u = ? n u, o` u ? est un isomorphisme de codes, Comptes rendus des séances de l'académie des sciences, pp.2597-2600, 1963.

M. [. Lindgren, Nordahl ? « Universal computation in simple onedimensional cellular automata, Complex Systems, vol.4, pp.299-318, 1990.

C. [. Lewis, Papadimitriou ? Elements of the theory of computation, 1988.

M. Margenstern, Morita ? « A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane, Journal of Universal Computer Science, vol.5, issue.9, pp.563-573, 1999.

K. Morita and ?. , Any irreversible cellular automaton can be simulated by a reversible one having the same dimension (on finite configurations), pp.92-137, 1992.

K. Morita and ?. , Universality of a reversible two-counter machine, Theoretical Computer Science, vol.168, issue.2, pp.303-320, 1996.
DOI : 10.1016/S0304-3975(96)00081-3

J. Mazoyer, 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

M. Matchtey, Young ? An Introduction to the general theory of algorithms , Theory of computation, 1978.

P. Orponen and ?. , A survey of continuous-time computation theory », Advances in Algorithms, languages and complexity, pp.209-224, 1994.

G. P?-aun and G. , Rozenberg et A. Salomaa ? DNA computing, 1998.

A. Rabinovich and ?. , On translations of temporal logic of actions into monadic second-order logic, Theoretical Computer Science, vol.193, issue.1-2, pp.197-214, 1998.
DOI : 10.1016/S0304-3975(97)00075-3

]. ?. Sha93 and C. E. Shannon, [Sie96] H. T. Siegelmann ? « The simple dynamics of super Turing theories, Theoretical Computer Science, vol.168, issue.2, pp.461-472, 1993.

P. [. Síma, Orponen ? « Computing with continuous-time Liapunov systems, pp.722-731, 2001.

]. R. Soa99, Soare ? « The history and concept of computability, 1999.

E. [. Siegelmann, On the Computational Power of Neural Nets, Journal of Computer and System Sciences, vol.50, issue.1, pp.132-150, 1995.
DOI : 10.1006/jcss.1995.1013

. [. Uspensky, Semenov ? Algorithms : main ideas and applications, Mathematics and its applications, ) ? Handbook of theoretical computer science, 1990.
DOI : 10.1007/978-94-015-8232-2

V. I. Varshavsky, V. B. Marakhovsky, and V. A. , Synchronization of interacting automata, Mathematical Systems Theory, vol.10, issue.1, pp.212-230, 1970.
DOI : 10.1007/BF01691105

P. Wolper, ?. Introductionàintroductionà-la-calculabilité, and I. , [Zei01] D. Zeilberger ? « " Real " analysis is a degenerate case of discrete analysis, International Conference on Difference Equations and Applications, 1991.