S. Aaronson, Guest Column: NP-complete problems and physical reality, ACM SIGACT News, vol.36, issue.1, pp.30-52, 2005.
DOI : 10.1145/1052796.1052804

S. Aaronson and J. Et-watrous, Closed timelike curves make quantum and classical computing equivalent, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.59, issue.13, pp.465631-647, 2009.
DOI : 10.1103/PhysRevLett.61.1446

D. S. Abrams and S. Lloyd, Computational Complexity and Physical Law, éditeur : 1st NASA International Conference on Quantum Computing and Quantum Communications (QCQC '98) numéro 1509 de LNCS, pp.167-173, 1998.
DOI : 10.1007/3-540-49208-9_14

G. C. Et-bandini and S. , Sirakoulis, éditeurs : Proceedings of the 10th International Conference on Cellular Automata for Research and Industry, numéro 7495 de LNCS, 2012.

A. Adamatzky, Collision-Based Computing, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00461197

A. Adamatzky and J. Et-durand-lose, Collision-based computing, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00461197

L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science, vol.266, issue.5187, pp.1021-1024, 1994.
DOI : 10.1126/science.7973651

A. Alhazov, M. J. Et-pérez-jiménez, J. Durand-lose, and M. Et-margenstern, Uniform solution of Q-SAT using polarizationless active membranes, éditeurs : 5th International Conference on Machines, Computations and Universality numéro 4664 de LNCS, pp.122-133, 2007.

M. Amos, DNA computation, Thèse de doctorat, 1997.

J. Arulanandham, Natural algorithms, Thèse de doctorat, 2005.

E. Asarin, O. Et-maler, and P. Thiagarajan, Achilles and the Tortoise climbing up the arithmetical hierarchy, éditeur : 15th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '95) numéro 1026 de LNCS, pp.471-483, 1995.

M. F. Barnsley and S. Et-demko, Iterated Function Systems and the Global Construction of Fractals, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.399, issue.1817, pp.243-275, 1985.
DOI : 10.1098/rspa.1985.0057

F. Becker, Géométrie pour l'auto-assemblage, Thèse de doctorat, 2008.

F. Becker, Pictures worth a thousand tiles, a geometrical programming language for self-assembly, Theoretical Computer Science, vol.410, issue.16, pp.4101495-1515, 2009.
DOI : 10.1016/j.tcs.2008.12.011
URL : https://hal.archives-ouvertes.fr/ensl-00248419

R. Beigel and B. Et-fu, Solving intractable problems with DNA computing, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), pp.154-169, 1998.
DOI : 10.1109/CCC.1998.694601
URL : http://1013seopc.eecs.uic.edu/papers/bf-dnasurvey-complexity98.PS.gz

R. Berger, The undecidability of the domino problem. Memoirs of the, p.66, 1966.

R. M. Blake, The Paradox of Temporal Process, The Journal of Philosophy, vol.23, issue.24, pp.645-654, 1926.
DOI : 10.2307/2013813

E. Blakey, Computational Complexity in Non-Turing Models of Computation, Electronic Notes in Theoretical Computer Science, vol.270, issue.1, pp.17-28, 2011.
DOI : 10.1016/j.entcs.2011.01.003

E. Blakey, Unconventional complexity measures for unconventional computers, Natural Computing, vol.27, issue.2, pp.1245-1259, 2011.
DOI : 10.1007/s11047-010-9226-9

L. Blum, F. Cucker, M. Shub, and S. Et-smale, Complexity and Real Computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

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

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

G. Boolos and R. C. Jeffrey, Computability and logic, 1980.
DOI : 10.1017/cbo9781139164931
URL : http://dx.doi.org/10.1016/0166-218x(90)90034-a

O. Bournez, P. Degano, R. Gorrieri, and A. Et-marchetti-spaccamela, Some Bounds on the Computational Power of Piecewise Constant Derivative Systems, éditeurs : 24th International Colloquium on Automata, Langages and Programming (ICALP '97 numéro 1256 de LNCS, pp.143-153, 1997.
DOI : 10.1007/s002240000111
URL : https://hal.archives-ouvertes.fr/inria-00100817

O. Bournez, Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy, Theoretical Computer Science, vol.210, issue.1, pp.21-71, 1999.
DOI : 10.1016/S0304-3975(98)00096-6

O. Bournez and M. L. Et-campagnolo, A survey on continuous time computations. ArXiv preprints, 0907.3117, p.3117, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00760976

T. A. Brun, Computers with closed timelike curves can solve hard problems efficiently, Foundations of Physics Letters, vol.16, issue.3, pp.245-253, 2003.
DOI : 10.1023/A:1025967225931

Y. Brun, Solving NP-complete problems in the tile assembly model, Theoretical Computer Science, vol.395, issue.1, pp.31-46, 2008.
DOI : 10.1016/j.tcs.2007.07.052

Y. Brun, Efficient 3-SAT algorithms in the tile assembly model, Natural Computing, vol.321, issue.5890, pp.209-229, 2012.
DOI : 10.1007/s11047-011-9299-0

G. Cantor, De la puissance des ensembles parfaits de points: Extrait d???une lettre adress??e ?? l?????diteur, Acta Mathematica, vol.4, issue.0, pp.381-392, 1884.
DOI : 10.1007/BF02418423

A. Church, A Set of Postulates For the Foundation of Logic, The Annals of Mathematics, vol.34, issue.4, pp.839-864, 1933.
DOI : 10.2307/1968702

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

S. A. Cook, M. A. Harrison, R. B. Banerji, and J. D. Et-ullman, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

J. B. Copeland, Accelerating Turing machines. Minds and Machines, pp.281-301, 2002.

I. ?ulik, K. Et-dube, and S. , Fractal and recurrent behavior of cellular automata, Complex Systems, vol.3, pp.253-267, 1989.

I. ?ulik, K. Hurd, L. P. Et-yu, and S. , Computation theoretic aspects of cellular automata, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, pp.357-378, 1990.
DOI : 10.1016/0167-2789(90)90194-T

R. Das, J. P. Crutchfield, M. Mitchell, Y. Davidor, H. Schwefel et al., A genetic algorithm discovers particlebased computation in cellular automata, éditeurs : 3rd International Conference on Parallel Problem Solving from Nature (PPSN III), numéro 866 de LNCS, pp.344-353, 1994.

R. Das, J. P. Crutchfield, M. Mitchell, J. E. Et-hanson, and L. J. Eshelman, Evolving globally synchronized cellular automata, éditeur : 6th International Conference on Genetic Algorithms (ICGA '95), pp.336-343, 1995.

M. Davis, The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, 2004.

M. Delorme and J. Et-mazoyer, Cellular Automata: a Parallel Model, Series on Mathematics and its Applications, 1999.
DOI : 10.1007/978-94-015-9153-9

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

D. Deutsch, Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.400, issue.1818, pp.40097-117, 1818.
DOI : 10.1098/rspa.1985.0070

M. Dindo?, Generalized Cantor Sets and Sets of Sums of Convergent Alternating Series, Journal of Applied Analysis, vol.7, issue.1, pp.131-150, 2001.
DOI : 10.1515/JAA.2001.131

D. Duchier, J. Durand-lose, M. Et-senot, O. Cheong, K. Chwa et al., Fractal Parallelism: Solving SAT in Bounded Space and Time, éditeurs : 21st International Symposium on Algorithms and Computation (ISAAC '10), numéro 6506 de LNCS, pp.279-290, 2010.
DOI : 10.1007/978-3-642-17517-6_26
URL : https://hal.archives-ouvertes.fr/hal-00511230

D. Duchier, J. Durand-lose, and M. Et-senot, Massively Parallel Automata in Euclidean Space-Time, 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshop, pp.104-109, 2010.
DOI : 10.1109/SASOW.2010.23
URL : https://hal.archives-ouvertes.fr/hal-00511958

D. Duchier, J. Durand-lose, M. Et-senot, H. Ganchev, B. Löwe et al., Solving Q-SAT in bounded space and time by geometrical computation éditeurs : Models of Computation in Context, 7th International Conference on Computability in Europe (CiE '11) (abstract and handout booklet), pp.76-86, 2011.

D. Duchier, J. Durand-lose, M. Et-senot, M. Agrawal, S. B. Cooper et al., Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants, éditeurs : 9th International Conference on Theory and Applications of Models of Computation (TAMC '12), numéro 7287 de LNCS, pp.435-447, 2012.
DOI : 10.1007/978-3-642-29952-0_42
URL : https://hal.archives-ouvertes.fr/hal-00673603

B. Durand, W. Penczek, and A. Et-szalas, Self-similarity viewed as a local property via tile sets, éditeurs : 21st international symposium on Mathematical Foundations of Computer Science (MFCS '96) numéro 1113 de LNCS, pp.312-323, 1996.
DOI : 10.1007/3-540-61550-4_158

J. Durand-lose, Intrinsic universality of a one-dimensional reversible cellular automaton, 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS '97 numéro 1200 de LNCS, pp.439-450, 1997.

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

J. Durand-lose, Calculer géométriquement sur le plan ? machines à signaux, 2003.

J. Durand-lose, Abstract geometrical computation for black hole computation (extended abstract), éditeur : 4th International Conference on Machines, Computations and Universality numéro 3354 de LNCS, pp.176-187, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00079709

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

J. Durand-lose, A. Beckmann, and J. V. Et-tucker, Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal, éditeurs : Logical Approaches to Computational Barriers, 2nd International Conference on Computability in Europe (CiE '06), numéro 3988 de LNCS, pp.163-172, 2006.
DOI : 10.1007/3-540-10003-2_104
URL : https://hal.archives-ouvertes.fr/hal-00079687

J. Durand-lose, S. B. Cooper, B. Löwe, and A. Et-sorbi, Abstract Geometrical Computation and the Linear??Blum, Shub and Smale Model, éditeurs : Computation and Logic in the Real World, 3rd International Conference on Computability in Europe (CiE '07), numéro 4497 de LNCS, pp.238-247, 2007.
DOI : 10.1007/978-3-540-73001-9_25
URL : https://hal.archives-ouvertes.fr/hal-00144173

J. Durand-lose, A. Beckmann, C. Dimitracopoulos, and B. Et-löwe, Abstract geometrical computation with accumulations: beyond the Blum, Shub and Smale model éditeurs : Logic and Theory of Algorithms, 4th International Conference on Computability in Europe (CiE '08), pp.107-116, 2008.

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, Abstract geometrical computation 5: embedding computable analysis, Special Issue on 8th International Conference on Unconventional Computation (UC '09), pp.1261-1273, 2011.
DOI : 10.1007/s11047-010-9229-6
URL : https://hal.archives-ouvertes.fr/hal-00454605

J. Durand-lose, Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation, International Journal of Unconventional Computing, vol.8, issue.1, pp.33-46, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00511224

J. Durand-lose, Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers, Special Issue on 10th International Conference on Unconventional Computation, pp.609-622, 2012.
DOI : 10.1007/s11047-012-9335-8
URL : https://hal.archives-ouvertes.fr/hal-00691466

J. Durand-lose, P. Bonizzoni, V. Brattka, and B. Et-löwe, Irrationality is needed to compute with signal machines with only three speeds éditeurs : The Nature of Computation, 9th International Conference on Computability in Europe (CiE '13), 2013.

G. A. Edgar, Classic on Fractals, 1993.

G. A. Edgar, Measure, Topology, and Fractal Geometry, 2008.

G. Etesi and I. Et-németi, Non-Turing computations via Malament?Hogarth space-time, International Journal of Theoretical Physics, vol.41, issue.2, pp.341-370, 2002.
DOI : 10.1023/A:1014019225365

R. P. Feynman, Quantum mechanical computers, Foundations of Physics, vol.6, issue.6, pp.507-531, 1986.
DOI : 10.1007/BF01886518

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. Fredkin and T. Et-toffoli, Conservative logic, International Journal of Theoretical Physics, vol.43, issue.3-4, pp.219-253, 1982.
DOI : 10.1007/BF01857727

R. Gandy, J. Barwise, J. H. Keisler, and K. Et-kunen, Church's thesis and principles for mechanisms éditeurs : The Kleene Symposium, de Studies in Logic and the Foundations of Mathematics, pp.123-148, 1980.

S. Goliaei and M. H. Et-foroughmand-araabi, Lower Bounds on the Complexity of the Wavelength-Based Machine, pp.94-105, 2012.
DOI : 10.1007/978-3-642-32894-7_10

S. Goliaei, S. Et-jalili, S. Dolev, and M. Et-oltean, Optical Graph 3-Colorability, éditeurs : International Workshop on Optical Super Computing (OSC '10), numéro 6748 de LNCS, pp.16-22, 2011.
DOI : 10.1017/CBO9780511804106

S. Goliaei and S. Et-jalili, An optical solution to the 3-SAT problem using wavelength based selectors, The Journal of Supercomputing, vol.8, issue.1, pp.663-672, 2012.
DOI : 10.1007/s11227-010-0494-z

E. Goto and T. Kitagawa, Puzzles on automata éditeur : The Road to Information Science, pp.67-92, 1966.

T. Gramß, S. Bornholdt, M. Groß, M. Mitchell, and T. Et-pellizzari, Non- Standard Computation, 1998.

F. Haeseler, H. Peitgen, and G. Et-skordev, Global analysis of self-similarity features of cellular automata: selected examples, Physica D: Nonlinear Phenomena, vol.86, issue.1-2, pp.64-80, 1995.
DOI : 10.1016/0167-2789(95)00088-L

M. Hagiya, Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing, 2005.
DOI : 10.1007/11560319_12

J. D. Hamkins and A. Lewis, Abstract, The Journal of Symbolic Logic, vol.39, issue.02, pp.567-604, 2000.
DOI : 10.1007/BF00682813

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1960.
DOI : 10.1090/S0002-9904-1929-04793-1

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.18, issue.4, pp.320-375, 1969.
DOI : 10.1007/BF01691062

M. Hogarth, D. Hull, M. Forbes, and R. Et-burian, Non-Turing Computers and Non-Turing Computability, éditeurs : Proceedings of the Biennial Meeting of the Philosophy of Science Association, pp.126-138, 1994.
DOI : 10.1086/psaprocbienmeetp.1994.1.193018
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.8361

U. Huckenbeck, Euclidian geometry in terms of automata theory, Theoretical Computer Science, vol.68, issue.1, pp.71-87, 1989.
DOI : 10.1016/0304-3975(89)90120-5

U. Huckenbeck, A result about the power of geometric oracle machines, Theoretical Computer Science, vol.88, issue.2, pp.231-251, 1991.
DOI : 10.1016/0304-3975(91)90375-C

T. Ito, S. Inokuchi, Y. Et-mizoguchi, A. Adamatzky, R. Alonso-sanz et al., An abstract collision system, éditeurs : International Workshop on Theory and Applications of Cellular Automata (AUTOMATA '08), pp.339-355, 2008.

G. Jacopini and G. Et-sontacchi, 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

S. C. Kleene, General recursive functions of natural numbers, Mathematische Annalen, vol.110, issue.1, pp.727-742, 1936.
DOI : 10.1007/BF01565439

K. Ko, R. Downey, D. Decheng, S. P. Tung, Y. H. Qiu et al., COMPUTATIONAL COMPLEXITY OF FRACTALS, Proceedings of the 7th and 8th Asian Logic Conferences, pp.252-269, 2003.
DOI : 10.1142/9789812705815_0011

G. Lafitte and R. Freivalds, How Powerful Are Infinite Time Machines?, éditeur : 13th International Symposium on Fundamentals of Computation Theory (FCT '01), numéro 2138 de LNCS, pp.252-263, 2001.
DOI : 10.1007/3-540-44669-9_25

J. Lathrop, J. H. Lutz, and S. M. Et-summers, Strict self-assembly of discrete Sierpinski triangles, Theoret. Comput. Sci, vol.410, pp.4-5384, 2009.

J. I. Lathrop, J. H. Lutz, M. J. Patitz, and S. M. Et-summers, Computability and Complexity in Self-assembly, Theory of Computing Systems, vol.XL, issue.1, pp.617-647, 2011.
DOI : 10.1007/s00224-010-9252-0

L. Levin, Universal'nye perebornye zadachi (Universal search problems) Problems of Information Transmission, pp.265-266, 1973.

V. Levorato, M. Et-senot, H. Bordhin, R. Freund, T. Hinze et al., Discrete signal machines via pretopology?one step from signal machines to cellular automata, éditeurs : 2nd International Workshop on Non-Classical Models of Automata and Applications (NCMA '10), numéro 263 de OCG Books, pp.127-140, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00511950

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

M. Margenstern and K. Et-morita, NP problems are tractable in the space of cellular automata in the hyperbolic plane, Theoretical Computer Science, vol.259, issue.1-2, pp.99-128, 2001.
DOI : 10.1016/S0304-3975(99)00328-X

J. Mazoyer, A six-state minimal time solution to the firing squad synchronization problem, Theoretical Computer Science, vol.50, issue.2, pp.183-238, 1987.
DOI : 10.1016/0304-3975(87)90124-1

J. Mazoyer, Computations on one-dimensional cellular automata, Annals of Mathematics and Artificial Intelligence, vol.9, issue.1, pp.285-309, 1996.
DOI : 10.1007/BF02127801

J. Mazoyer and V. Et-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. Mazoyer and J. Et-yunès, Computations on cellular automata, Handbook of Nat. Comp. 2012], chapitre 5, pp.159-188, 2012.
DOI : 10.1007/978-3-540-92910-9_5
URL : https://hal.archives-ouvertes.fr/hal-00578620

M. Minsky, Computation: Finite and Infinite Machines, 1967.

C. Moore, Recursion theory on the reals and continuous-time computation, Theoretical Computer Science, vol.162, issue.1, pp.23-44, 1996.
DOI : 10.1016/0304-3975(95)00248-0

J. Mycka, F. Coelho, J. F. Et-costa, C. S. Calude, M. J. Dinneen et al., The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem, éditeurs : 5th International Conference on Unconventional Computation (UC '06), numéro 4135 de LNCS, pp.195-206, 2006.
DOI : 10.1007/11839132_16

T. J. Naughton and D. Et-woods, An optical model of computation, Theoret. Comput. Sci, vol.334, issue.1-3, pp.227-258, 2005.

I. Németi and G. Et-dávid, Relativistic computers and the Turing barrier, Applied Mathematics and Computation, vol.178, issue.1, pp.118-142, 2006.
DOI : 10.1016/j.amc.2005.09.075

N. Ollinger and G. Et-richard, Automata on the plane vs particles and collisions, Theoretical Computer Science, vol.410, issue.27-29, pp.27-292767, 2009.
DOI : 10.1016/j.tcs.2009.03.039
URL : https://hal.archives-ouvertes.fr/hal-00310960

N. Ollinger and G. Et-richard, Four states are enough! Theoret, Comput. Sci, vol.412, issue.1 2, pp.22-32, 2011.
DOI : 10.1016/j.tcs.2010.08.018
URL : http://doi.org/10.1016/j.tcs.2010.08.018

C. Papadimitriou, Computational Complexity, 1994.

M. J. Patitz and S. M. Et-summers, Self-assembly of discrete self-similar fractals, Natural Computing, vol.XL, issue.1, pp.135-172, 2010.
DOI : 10.1007/s11047-009-9147-7

G. P?un, Computing with Membranes, Journal of Computer and System Sciences, vol.61, issue.1, pp.108-143, 2000.
DOI : 10.1006/jcss.1999.1693

G. P?un, On P Systems with Active Membranes, Journal of Automata, Languages and Combinatorics, vol.6, issue.1, pp.75-90, 2001.
DOI : 10.1007/978-1-4471-0313-4_15

G. P?un and G. Et-rozenberg, A guide to membrane computing, Theoretical Computer Science, vol.287, issue.1, pp.73-100, 2002.
DOI : 10.1016/S0304-3975(02)00136-6

G. P?un, G. Rozenberg, and A. Et-salomaa, DNA Computing, New Computing Paradigms, 1998.

E. Post, Formal Reductions of the General Combinatorial Decision Problem, American Journal of Mathematics, vol.65, issue.2, pp.197-215, 1943.
DOI : 10.2307/2371809

P. H. Potgieter, Zeno machines and hypercomputation, Theoretical Computer Science, vol.358, issue.1, pp.23-33, 2006.
DOI : 10.1016/j.tcs.2005.11.040
URL : http://doi.org/10.1016/j.tcs.2005.11.040

J. H. Reif, J. D. Tygar, and A. Et-yoshida, The computability and complexity of optical beam tracing, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.106-114, 1990.
DOI : 10.1109/FSCS.1990.89529

G. Richard, Systèmes de particules et collisions discrètes dans les automtates cellulaires, Thèse de doctorat, 2008.

P. W. Rothemund, E. Et-winfree, F. F. Yao, and E. M. Et-luks, The program-size complexity of self-assembled squares (extended abstract), Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.459-468, 2000.
DOI : 10.1145/335305.335358

B. A. Russell, The limits of empiricism, Proceedings of the Aristotelian Society, pp.131-150, 1936.

M. Schaller and K. Et-svozil, Zeno squeezing of cellular automata, International Journal of Unconventional Computing, vol.6, issue.5, pp.399-416, 2010.

C. E. Shannon, Mathematical Theory of the Differential Analyzer, Journal of Mathematics and Physics, vol.XXII, issue.1-4, pp.337-354, 1941.
DOI : 10.1002/sapm1941201337

P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.124-134, 1994.
DOI : 10.1109/SFCS.1994.365700
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3862

H. T. Siegelmann and E. D. Et-sontag, On the computational power of neural nets, Proceedings of the fifth annual workshop on Computational learning theory , COLT '92, pp.132-150, 1995.
DOI : 10.1145/130385.130432

W. Sierpi?ski, Sur une courbe dont tout point est un point de ramification, Comptes Rendus de l'Académie des Sciences de Paris, pp.302-305, 1915.

P. M. Sosík, C. Martín-vide, and G. Et-p?un, Solving a PSPACE-Complete problem by P-systems with active membranes, éditeurs : Brainstorming Week on Membrane Computing, pp.305-312, 2003.

M. Stannett, The case for hypercomputation, Applied Mathematics and Computation, vol.178, issue.1, pp.8-24, 2006.
DOI : 10.1016/j.amc.2005.09.067

M. Stannett, Computation and spacetime structure, International Journal of Unconventional Computing, vol.9, issue.12, pp.173-184, 2013.

W. M. Stevens, C. S. Calude, J. Kari, I. Petre, and G. Et-rozenberg, Computing with planar toppling domino arrangements, éditeurs : 10th International Conference on Unconventional Computation (UC '11), numéro 6714 de LNCS, pp.224-233, 2011.
DOI : 10.1007/s11047-012-9341-x
URL : http://eprints.uwe.ac.uk/16080/1/domino.pdf

L. J. Stockmeyer, A. R. Meyer, A. V. Aho, A. Borodin, R. L. Constable et al., Word problems requiring exponential time(Preliminary Report), Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.1-9, 1973.
DOI : 10.1145/800125.804029
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4618

I. Takeuti, Transition Systems over Continuous Time-Space, Electronic Notes in Theoretical Computer Science, vol.120, pp.173-186, 2005.
DOI : 10.1016/j.entcs.2004.06.043
URL : http://doi.org/10.1016/j.entcs.2004.06.043

A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.

P. Van-emde-boas and J. Van-leeuwen, Machine Models and Simulation éditeur : Handbook of Theoretical Computer Science, Algorithms and Complexity, volume A, chapitre I, pp.1-66, 1990.

H. Vollmer, Introduction to circuit complexity?a uniform approach. Texts in Theoretical Computer Science, 1999.

H. Von-koch, On a continuous curve without tangents, constructible from elementary geometry, pp.25-45, 1904.

J. Von-neumann, Theory of self-reproducing automata éditeur : Theory of Self-Reproducing Automata, 1966.

H. Wang, Proving theorems by pattern recognition I, Communications of the ACM, vol.3, issue.4, pp.220-234, 1960.
DOI : 10.1145/367177.367224

K. Weihrauch, Computable Analysis: an introduction, 2000.

S. J. Willson, Growth rates and fractional dimensions in cellular automata, Physica D: Nonlinear Phenomena, vol.10, issue.1-2, pp.69-74, 1984.
DOI : 10.1016/0167-2789(84)90250-1

E. Winfree, Algorithmic Self-Assembly of DNA, 2006 International Conference on Microtechnologies in Medicine and Biology, 1998.
DOI : 10.1109/MMB.2006.251471

S. Wolfram, Computation theory of cellular automata, Communications in Mathematical Physics, vol.30, issue.1, pp.15-57, 1984.
DOI : 10.1007/BF01217347

S. Wolfram, A New Kind of Science, Applied Mechanics Reviews, vol.56, issue.2, 2002.
DOI : 10.1115/1.1553433

J. Yunès, Seven-state solutions to the firing squad synchronization problem, Theoretical Computer Science, vol.127, issue.2, pp.313-332, 1994.
DOI : 10.1016/0304-3975(94)90045-0

J. Yunès, J. Durand-lose, and M. Et-margenstern, Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution, éditeurs : 5th International Conference on Machines, Computations and Universality (MCU '07), numéro 4664 de LNCS, pp.316-324, 2007.
DOI : 10.1007/978-3-540-74593-8_27

J. Yunès and B. Durand, Goto's construction and Pascal's triangle: new insights into cellular automata synchronization, éditeur : 1st Symposium on Cellular Automata « Journées Automates Cellulaires » (JAC '08), pp.195-203, 2008.

J. Yunès, Grids and universal computations on one-dimensional cellular automata, Natural Computing, vol.217, issue.1, pp.303-309, 2012.
DOI : 10.1007/s11047-012-9312-2

T. Zerjatke and M. Sturm, Solving a PSPACE-complete problem by gene assembly, Journal of Logic and Computation, vol.23, issue.4, pp.1-12, 2011.
DOI : 10.1093/logcom/exr052

M. Ziegler, Physically-relativized Church???Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics, Applied Mathematics and Computation, vol.215, issue.4, pp.1431-1447, 2009.
DOI : 10.1016/j.amc.2009.04.062