]. A. Ada02 and . Adamatzky, Collision based computing, 2002.

E. Asarin and O. Maler, Achilles and the Tortoise climbing up the arithmetical hierarchy, FSTTCS '95, number 1026 in LNCS, pp.471-483, 1995.

C. H. Bennett, Logical Reversibility of Computation, IBM Journal of Research and Development, vol.17, issue.6, pp.525-532, 1973.
DOI : 10.1147/rd.176.0525

C. H. Bennett, Notes on the history of reversible computation, IBM Journal of Research and Development, vol.32, issue.1, pp.16-23, 1988.
DOI : 10.1147/rd.321.0016

N. Boccara, J. Nasser, and M. Roger, 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

. Fig, 7. The reversible simulations for same automaton and values

]. O. Bou99 and . Bournez, Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy, Cul87] K. ? Culik II. On invertible cellular automata. Complex Systems, pp.21-711035, 1987.

J. Durand-lose, Reversible cellular automaton able to simulate any other reversible one using partitioning automata, LATIN '95, number 911 in LNCS, pp.230-244, 1995.
DOI : 10.1007/3-540-59175-3_92

J. Durand-lose, Intrinsic universality of a 1-dimensional reversible Cellular Automaton, STACS '97 number 1200 in LNCS, pp.439-450, 1997.
DOI : 10.1007/BFb0023479

J. Durand-lose, Computing Inside the Billiard Ball Model, Collision-based computing, pp.135-160, 2002.
DOI : 10.1007/978-1-4471-0129-1_6

J. Durand-lose, Abstract geometrical computation for black hole computation (extended abstract), Machines, Computations, and Universality number 3354 in LNCS, pp.176-187, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00079709

J. Durand-lose, Abstract Geometrical Computation: Turing-Computing Ability and Undecidability, New Computational Paradigms, 1st Conference on Computability in Europe (CiE '05), number 3526 in LNCS, pp.106-116, 2005.
DOI : 10.1007/11494645_14
URL : https://hal.archives-ouvertes.fr/hal-00079815

J. Durand-lose, Abstract geometrical computation 1: embedding black hole computations with rational numbers, Fundamenta Informaticae, vol.74, issue.4, pp.491-510, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00079720

M. Delorme and J. Mazoyer, Signals on Cellular Automata, pp.234-275, 2002.
DOI : 10.1007/978-1-4471-0129-1_9

J. Dubacq, HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA, International Journal of Foundations of Computer Science, vol.06, issue.04, pp.395-402, 1995.
DOI : 10.1142/S0129054195000202

E. Fredkin and T. Toffoli, Conservative logic, International Journal of Theoretical Physics, vol.214, issue.3, pp.219-253, 1982.
DOI : 10.1007/978-1-4471-0129-1_3

A. [. Ilachinski, G. Jacopini, and . Sontacchi, Cellular automata ?a discrete universe Reversible parallel computation: an evolving space-model, World Scientific Theoret. Comp. Sci, vol.73, issue.1, pp.1-46, 1990.

M. H. Jakubowsky, K. Steiglitz, and R. Squier, Computing with Solitons: A Review and Prospectus, pp.277-297, 2002.
DOI : 10.1007/978-1-4471-0129-1_10

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

J. Kari, Reversibility and surjectivity problems of cellular automata, Journal of Computer and System Sciences, vol.48, issue.1, pp.149-182, 1994.
DOI : 10.1016/S0022-0000(05)80025-X

J. Kari, Representation of reversible cellular automata with block permutations, Mathematical Systems Theory, vol.98, issue.1, pp.47-61, 1996.
DOI : 10.1007/BF01201813

Y. Lecerf, 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.

K. Lindgren and M. G. , Universal computation in simple onedimensional cellular automata, Complex Systems, vol.4, pp.299-318, 1990.

M. Li, J. Tromp, and P. Vitanyi, Reversible simulation of irreversible computation, Physica D: Nonlinear Phenomena, vol.120, issue.1-2, pp.168-176, 1998.
DOI : 10.1016/S0167-2789(98)00052-9

M. Minsky, Finite and infinite machines, 1967.

K. Morita, Computation-universality of one-dimensional one-way reversible cellular automata, Information Processing Letters, vol.42, issue.6, pp.325-329, 1992.
DOI : 10.1016/0020-0190(92)90231-J

K. Morita, Reversible simulation of one-dimensional irreversible cellular automata, Theoretical Computer Science, vol.148, issue.1, pp.157-163, 1995.
DOI : 10.1016/0304-3975(95)00038-X

K. Morita, 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 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

T. Toffoli and N. Margolus, Invertible cellular automata: A review, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, pp.229-253, 1990.
DOI : 10.1016/0167-2789(90)90185-R
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.1314

T. Toffoli, Computation and construction universality of reversible cellular automata, Journal of Computer and System Sciences, vol.15, issue.2, pp.213-231, 1977.
DOI : 10.1016/S0022-0000(77)80007-X

T. Toffoli, Reversible computing, ICALP, pp.632-644, 1980.
DOI : 10.1007/3-540-10003-2_104