, Collision based computing, 2002.
Achilles and the Tortoise climbing up the arithmetical hierarchy, FSTTCS '95, number 1026 in LNCS, pp.471-483, 1995. ,
Complexity and Real Computation, 1998. ,
Particle-like structures and interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular automaton rules, Phys. Rev. A, vol.44, issue.2, pp.866-875, 1991. ,
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy, Theoret. Comp. Sci, vol.210, issue.1, pp.21-71, 1999. ,
URL : https://hal.archives-ouvertes.fr/hal-02101790
Universal computation and other capabilities of hybrid and continuous dynamical systems, Theoret. Comp. Sci, vol.138, issue.1, pp.67-100, 1995. ,
Intrinsic universality of a 1-dimensional reversible cellular automaton, STACS '97, number 1200 in LNCS, pp.439-450, 1997. ,
URL : https://hal.archives-ouvertes.fr/hal-01559642
Parallel transient time of one-dimensional sand pile, Theoret. Comp. Sci, vol.205, issue.1-2, pp.183-193, 1998. ,
Reversible space-time simulation of cellular automata, Theoret. Comp. Sci, vol.246, issue.1-2, pp.117-129, 2000. ,
Calculer géométriquement sur le plan -machinesàmachines`machinesà signaux -. Habilitationà Habilitationà diriger des recherches, ´ Ecole Doctorale STIC, 2003. ,
Signals on cellular automata, pp.234-275, 2002. ,
Non-Turing computations via Malament-Hogarth space-times, Int. J. Theor. Phys, vol.41, pp.341-370, 2002. ,
Beyond Turing machines, Bull. EATCS, vol.81, pp.279-304, 2003. ,
Generation of primes by a one-dimensional real-time iterative array, J. ACM, vol.12, issue.3, pp.388-394, 1965. ,
,
, , pp.67-92, 1966.
Infinite time Turing machines: Supertask computation, Minds and Machines, vol.12, issue.4, pp.521-539, 2002. ,
An upper bound on the products of particle interactions in cellular automata, Phys. D, vol.154, pp.240-258, 2001. ,
Cellular Automata -A Discrete Universe, 2001. ,
Reversible parallel computation: an evolving space-model, Theoret. Comp. Sci, vol.73, issue.1, pp.1-46, 1990. ,
Computing with solitons: A review and prospectus, pp.277-297, 2002. ,
Universal computation in simple one-dimensional cellular automata, Complex Systems, vol.4, pp.299-318, 1990. ,
On optimal solutions to the Firing squad synchronization problem, Theoret. Comp. Sci, vol.168, issue.2, pp.367-404, 1996. ,
Finite and Infinite Machines, 1967. ,
Recursion theory on the reals and continuous-time computation, Theoret. Comp. Sci, vol.162, issue.1, pp.23-44, 1996. ,
Signals in one-dimensional cellular automata, Theoret. Comp. Sci, vol.217, issue.1, pp.53-80, 1999. ,
URL : https://hal.archives-ouvertes.fr/hal-02101868
Classical Recursion Theory, Number 143 in Studies in Logic and the Foundations of Mathematics, vol.2, 1999. ,
A survey of continuous-time computation theory, Advances in Algorithms, languages and complexity, pp.209-224, 1994. ,
Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers), Trans. Amer. Math. Soc, vol.199, pp.1-28, 1974. ,
Computing with continuous-time Liapunov systems, STOC '01, pp.722-731, 2001. ,
On the computational power of neural nets, J. Comput. System Sci, vol.50, issue.1, pp.132-150, 1995. ,
Synchronization of interacting automata, Math. System Theory, vol.4, issue.3, pp.212-230, 1970. ,
Introduction to Computable Analysis. Texts in theoretical computer science, 2000. ,