Abstract Geometrical Computation: Turing-Computing Ability and Undecidability, New Computational Paradigms, 1st Conf. Computability in Europe (CiE '05). Number 3526, p.106116, 2005. ,
DOI : 10.1007/11494645_14
URL : https://hal.archives-ouvertes.fr/hal-00079815
Small universal Turing machines, Theoretical Computer Science, vol.168, issue.2, p.215240, 1996. ,
DOI : 10.1016/S0304-3975(96)00077-1
URL : http://doi.org/10.1016/s0304-3975(96)00077-1
The complexity of small universal Turing machines: A survey, Theoretical Computer Science, vol.410, issue.4-5, pp.410-443450, 2009. ,
DOI : 10.1016/j.tcs.2008.09.051
Universality in elementary cellular automata, Complex Systems, vol.15, p.140, 2004. ,
Four states are enough! Theoret, Comp. Sci, pp.412-2232, 2011. ,
DOI : 10.1016/j.tcs.2010.08.018
URL : http://doi.org/10.1016/j.tcs.2010.08.018
Frontier between decidability and undecidability: a survey, Theoretical Computer Science, vol.231, issue.2, p.217251, 2000. ,
DOI : 10.1016/S0304-3975(99)00102-4
URL : http://doi.org/10.1016/s0304-3975(99)00102-4
Abstract geometrical computation 4: Small Turing universal signal machines, Theoretical Computer Science, vol.412, issue.1-2, pp.412-5767, 2011. ,
DOI : 10.1016/j.tcs.2010.07.013
URL : https://hal.archives-ouvertes.fr/hal-00504876
Abstract geometrical computation 8: Small machines, accumulations & rationality, Draft, 2013. ,
Abstract geometrical computation 3: black holes for classical and analog computing, Natural Computing, vol.59, issue.4, p.455472, 2009. ,
DOI : 10.1007/s11047-009-9117-0
URL : https://hal.archives-ouvertes.fr/hal-00447966
Euclidian geometry in terms of automata theory, Theoretical Computer Science, vol.68, issue.1, p.7187, 1989. ,
DOI : 10.1016/0304-3975(89)90120-5
The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem, Unconventional Computation, 5th Int. Conf., UC '06 Proceedings. Number 4135, 2006. ,
DOI : 10.1007/11839132_16
Some bounds on the computational power of piecewise constant derivative systems (extended abstract), Number 1256, p.143153, 1997. ,
DOI : 10.1007/3-540-63165-8_172
Reversible parallel computation: an evolving spacemodel, Theoret. Comp. Sci, pp.73-146, 1990. ,
DOI : 10.1016/0304-3975(90)90160-j
URL : http://doi.org/10.1016/0304-3975(90)90160-j
Computations on one-dimensional cellular automata, Annals of Mathematics and Artificial Intelligence, vol.9, issue.1, p.285309, 1996. ,
DOI : 10.1007/BF02127801
Signals in one-dimensional cellular automata, Theoretical Computer Science, vol.217, issue.1, p.5380, 1999. ,
DOI : 10.1016/S0304-3975(98)00150-9
URL : http://doi.org/10.1016/s0304-3975(98)00150-9
The signal point of view: from cellular automata to signal machines, Journées Automates cellulaires (JAC '08, p.238, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00274005
Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants, Theory and Applications of Models of Computations (TAMC '12). Number 7287, p.435447, 2012. ,
DOI : 10.1007/978-3-642-29952-0_42
URL : https://hal.archives-ouvertes.fr/hal-00673603
Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers, Natural Computing, vol.120, issue.1, 2012. ,
DOI : 10.1007/s11047-012-9335-8
URL : https://hal.archives-ouvertes.fr/hal-00691466
Calculer géométriquement sur le plan machines à signaux. Habilitation à Diriger des Recherches, 2003. ,
Forcasting black holes in abstract geometrical computation is highly unpredictable, Theory and Applications of Models of Computations (TAMC '06). Number 3959, p.644653, 2006. ,
DOI : 10.1007/11750321_61
URL : https://hal.archives-ouvertes.fr/hal-00079692