Universalities in cellular automata a (short) survey

JAC 2008 - Journees Automates Cellulaires, Proceedings

Volumn , Issue , 2008, Pages 102-118

  Ollinger, Nicolas ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Cellular automata; Reversibility; Universality

Indexed keywords

REVERSIBILITY; UNIVERSALITY;

CELLULAR AUTOMATA;

AUTOMATA THEORY;

EID: 84880224791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (87)

1. J. Albert and K. Culik, A simple universal cellular automaton and its one-way and totalistic version, Complex Systems 1 (1987), no. 1, 1-16.
2. S. Amoroso and Y. N. Patt, Decision pr cedures for surjectivity and injectivity of parallel maps for tessellation structures, Journal of Computer and System Sciences 6 (1972), 448-464.
3. M. A. Arbib, Simple self-reproducing universal automata, Information and Control 9 (1966), no. 2, 177-189.
4. E. R. Banks, Universality in cellular automata, Symposium on Switching and Automata Theory (Santa Monica, California, 1970), IEEE, 1970, pp. 194-215.
5. E. R. Banks, Information processing and transmission in cellular automata, Ph.D. thesis, Massachusetts Institute of Technology, 1971.
6. R. Bartlett and M. Garzon, Monomial cellular automata, Complex Systems 7 (1993), no. 5, 367-388.
7. R. Bartlett and M. Garzon, Bilinear cellular automata, Complex Systems 9 (1995), no. 6, 455-476.
8. C. H. Bennett, Logical reversibility of computation, IBM Journal of Research and Development 17 (1973), no. 6, 525-532.
9. E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning ways for your mathematical plays. Vol. 2, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London, 1982, Games in particular.
10. A. W. Burks, Programming and the theory of automata, Essays on Cellular Automata (A. W. Burks, ed.), University of Illinois Press, Urbana, 1970, pp. 65-83 (Essay Two).
11. A. W. Burks, Towards a theory of automata based on more realistic primitive elements, Essays on Cellular Automata (A. W. Burks, ed.), University of Illinois Press, Urbana, 1970, pp. 84-102 (Essay Three).
12. A. W. Burks, Von neumann's self-reproducing automata, Essays on Cellular Automata (A. W. Burks, ed.), University of Illinois Press, Urbana, 1970, pp. 3-64 (Essay One).
13. J. Cocke and M. Minsky, Universality of tag systems with p=2, J. ACM 11 (1964), no. 1, 15-20.
14. E. F. Codd, Cellular automata, Academic Press, New York, 1968.
15. M. Cook, Universality in elementary cellular automata, Complex Systems 15 (2004), 1-40.
16. M. D. Davis, A note on universal turing machines, Automata Studies (C. E. Shannon and J. McCarthy, eds.), Princeton University Press, Princeton, 1956, pp. 167-175.
17. M. D. Davis, The universal computer: The road from leibniz to turing, W. W. Norton & Company, 2000.
18. M. Delorme, An introduction to cellular automata: some basic definitions and concepts, Cellular automata (Saissac, 1996) (M. Delorme and J. Mazoyer, eds.), Kluwer Acad. Publ., Dordrecht, 1999, pp. 5- 49.
19. J.C. Delvenne, P. Kurka, and V. D. Blondel, Decidability and universality in symbolic dynamical systems, Fundam. Inform. 74 (2006), no. 4, 463-490.
20. A. K. Dewdney, The cellular automata programs that create wireworld, rugworld and other diversions, Scientific American 262 (1990), 146-149.
21. Jean-Christophe Dubacq, How to simulate turing machines by invertible one-dimensional cellular automata, Int. J. Found. Comput. Sci. 6 (1995), no. 4, 395-402.
22. B. Durand and Z. Roka, The game of life: universality revisited, Cellular automata (Saissac, 1996) (M. Delorme and J. Mazoyer, eds.), Kluwer Acad. Publ., Dordrecht, 1999, pp. 51-74.
23. J. Durand-Lose, Reversible cellular automaton able to simulate any other reversible one using partitioning automata, LATIN '95 (R. A. Baeza-Yates, E. Goles Ch., and P. V. Poblete, eds.), Lecture Notes in Computer Science, vol. 911, Springer, 1995, pp. 230-244.
24. J. Durand-Lose, Automates cellulaires, automates partitions et tas de sable, Ph.D. thesis, Universit́e Bordeaux I, 1996.
25. J. Durand-Lose, Intrinsic universality of a 1-dimensional reversible cellular automaton, STACS 97 (L̈ubeck), Lecture Notes in Comput. Sci., vol. 1200, Springer, Berlin, 1997, pp. 439-450.
26. Patrick C. Fischer, On formalisms for turing machines, J. ACM 12 (1965), no. 4, 570-580.
27. E. Fredkin and T. Toffoli, Conservative logic, International Journal of Theoretical Physics 21 (1982), 219-253.
28. A. Gajardo and E. Goles, Universal cellular automaton over a hexagonal tiling with 3 states, IJAC 11 (2001), no. 3, 335-354.
29. M. Gardner, Mathematical games: The fantastic combinations of John Conway's new solitaire game 'Life', Scientific American 223 (1970), no. 4, 120-123.
30. K. Godel, Uber formal unentscheidbare Satze der Principia Mathematica und verwandter Systeme I, Monatschefte fur Mathematik und Physik 38 (1931), 173-198, .
31. S. Feferman, W. Dawson, S.C. Kleene, G. Moore, R.M. Solovay, J. van Heijendort (eds.), Kurt Godel: Collected Works, Oxford University Press, Oxford, 1 (1986), 144-195.
32. G. A. Hedlund, Endormorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory 3 (1969), 320-375.
33. Hertling, Embedding cellular automata into reversible ones, Unconventional Models of Computation, Springer, 1998 (C. S. Calude, J. Casti, and M. J. Dinneen, eds.), 1998.
34. K. Imai and K. Morita, A computation-universal two-dimensional 8-state triangular reversible cellular automaton, Theoretical Computer Science 231 (2000), no. 2, 181-191.
35. J. Kari, Reversibility of 2D cellular automata is undecidable, Physica D. Nonlinear Phenomena 45 (1990), no. 1-3, 379-385, Cellular automata: Theory and experiment (Los Alamos, NM, 1989).
36. J. Kari, Reversibility and surjectivity problems of cellular automata, J. Comput. Syst. Sci. 48 (1994), no. 1, 149-182.
37. J. Kari, Theory of cellular automata: A survey, Theoretical Computer Science 334 (2005), 3-33.
38. S. C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies (C. E. Shannon and J. McCarthy, eds.), Princeton University Press, Princeton, 1956, pp. 3-41.
39. G. Lafitte, Godel incompleteness revisited, personal communication (submitted to JAC 2008), 2008.
40. C.G. Langton, Self-reproduction in cellular automata, Physica D 10 (1984), no. 1-2, 135-144.
41. Y. Lecerf, Machines de turing reversibles, C. R. Acad. Sci. Paris 257 (1963), 2597-2600.
42. K. Lindgren and M. G. Nordahl, Universal computation in simple one-dimensional cellular automata, Complex Systems 4 (1990), no. 3, 299-318.
43. N. Margolus, Physics-like models of computation, Physica D 10 (1984), 81-95.
44. B. Martin, Construction modulaire d'automates cellulaires, Ph.D. thesis, Ecole Normale Suṕerieure de Lyon, 1993.
45. B. Martin, A universal cellular automaton in quasilinear time and its S-m-n form, Theoretical Computer Science 123 (1994), no. 2, 199-237.
46. J. Mazoyer, Computations on one dimensional cellular automata, Ann. Math. Artif. Intell. 16 (1996), 285-309.
47. J. Mazoyer, Computations on grids, Cellular automata (Saissac, 1996), Kluwer Acad. Publ., Dordrecht, 1999, pp. 119-149.
48. J. Mazoyer and Ivan Rapaport, Inducing an order on cellular automata by a grouping operation, Discrete Applied Mathematics 91 (1999), no. 1-3, 177-196.
49. J. Mazoyer and Veronique Terrier, Signals in one-dimensional cellular automata, Theoretical Computer Science 217 (1999), no. 1, 53-80, Cellular automata (Milan, 1996).
50. W. S. McCulloch and W. Pitts, A logical calculus of the ideas immanent in nervous activity, Bulletin of Mathematical Biophysics 5 (1943), 115-133.
51. D. B. Miller and E. Fredkin, Two-state, reversible, universal cellular automata in three dimensions, Conf. Computing Frontiers (N. Bagherzadeh, M. Valero, and A. Raḿirez, eds.), ACM, 2005, pp. 45-51.
52. M. Minsky, Computation: Finite and infinite machines, Prentice Hall, Englewoods Cliffs, 1967.
53. E. F. Moore, Machine models of self-reproduction, Proceedings of Symposia in Applied Mathematics, vol. 14, American Mathematical Society, 1962, pp. 17-33.
54. E. F. Moore, Machine models of self-reproduction, Essays on Cellular Automata (A. W. Burks, ed.), University of Illinois Press, Urbana, 1970, pp. 187-203 (Essay Six).
55. A. Moreira, Universality and decidability of number-conserving cellular automata, Theoretical Computer Science 292 (2003), no. 3, 711-721.
56. K. Morita, A simple construction method of a reversible finite automaton out of fredkin gates, and its related problem, IEICE Trans. Inf. & Syst. 73 (1990), no. 6, 978-984.
57. K. Morita, Reversible simulation of one-dimensional irreversible cellular automata, Theoretical Computer Science 148 (1995), no. 1, 157-163.
58. K. Morita and M. Harao, Computation universality of one-dimensional reversible (injective) cellular automata, IEICE Trans. Inf. & Syst. E 72 (1989), 758-762.
59. K. Morita and K. Imai, Self-reproduction in a reversible cellular space, Theoretical Computer Science 168 (1996), no. 2, 337-366.
60. K. Morita and K. Imai, Number-conserving reversible cellular automata and their computation-universality, Theoretical Informatics and Applications 35 (2001), no. 3, 239-258.
61. T. Neary and D. Woods, P-completeness of cellular automaton rule 110, Proceedings of ICALP 2006, Lecture Notes in Computer Science, vol. 4051, Springer, Berlin, 2006, pp. 132-143.
62. F. Noural and R.S. Kashef, A universal four-state cellular computer, IEEE Transactions on Computers 24 (1975), no. 8, 766-776.
63. N. Ollinger, Two-states bilinear intrinsically universal cellular automata, Fundamentals of computation theory (Riga, Latvia, 2001) (Berlin) (R. Freivalds, ed.), Lecture Notes in Computer Science, vol. 2138, Springer, 2001, pp. 396-399.
64. N. Ollinger, Automates cellulaires : structures, Ph.D. thesis, ́Ecole Normale Suṕerieure de Lyon, 2002.
65. N. Ollinger, The quest for small universal cellular automata, International Colloquium on Automata, languages and programming (Ḿalaga, Spain, 2002) (Berlin) (P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, eds.), Lecture Notes in Computer Science, vol. 2380, Springer, 2002, pp. 318-329.
66. N. Ollinger, The intrinsic universality problem of one-dimensional cellular automata, Symposium on Theoretical Aspects of Computer Science (Berlin, Germany, 2003), Lecture Notes in Computer Science, Springer, Berlin, 2003, (to appear).
67. D. Perrin, Les debuts de la theorie des automates, Technique et Science Informatique 14 (1995), 409-433.
68. E. Post, The two-valued iterative systems of mathematical logic, Princeton University Press, Princeton, 1941.
69. N. Ollinger, Formal reductions of the general combinatorial decision problem, American Journal of Mathematics 65 (1943), no. 2, 197-215.
70. I. Rapaport, Inducing an order on cellular automata by a grouping operation, Ph.D. thesis, ́Ecole Normale Suṕerieure de Lyon, 1998.
71. G. Richard, From turing machine to rule 110: embedding computational power in small cellular automata through particles and collisions, personal communication (submitted to JAC 2008), 2008.
72. G. Richard, A particular universal cellular automaton, personal communication, 2008.
73. D. Richardson, Tessellations with local transformations, Journal of Computer and System Sciences 6 (1972), 373-388.
74. C. E. Shannon, A universal turing machine with two internal states, Automata Studies (C. E. Shannon and J. McCarthy, eds.), Princeton University Press, Princeton, 1956, pp. 157-165.
75. A. R. Smith, Simple computation-universal cellular spaces, Journal of the ACM 18 (1971), 339-353.
76. K. Sutner, Universality and cellular automata, MCU 2004 (M. Margenstern, ed.), Lecture Notes in Computer Science, vol. 3354, Springer, 2004, pp. 50-59.
77. J. W. Thatcher, Self-describing turing machines and self-reproducing cellular automata, Essays on Cellular Automata (A. W. Burks, ed.), University of Illinois Press, Urbana, 1970, pp. 103-131 (Essay Four).
78. J. W. Thatcher, Universality in the von neumann cellular model, Essays on Cellular Automata (A. W. Burks, ed.), University of Illinois Press, Urbana, 1970, pp. 132-186 (Essay Five).
79. G. Theyssier, Automates cellulaires : un modele de complexites, Ph.D. thesis, Ecole Normale Superieure de Lyon, 2005.
80. G. Theyssier, How common can be universality for cellular automata?, STACS 2005, Lecture Notes in Computer Science, vol. 3404, Springer, 2005, pp. 121-132.
81. Tommaso Toffoli, Computation and construction universality of reversible cellular automata, J. Comput. Syst. Sci. 15 (1977), no. 2, 213-231.
82. A. M. Turing, On computable numbers with an application to the entscheidungs problem, Proceedings of the London Mathematical Society 242 (1936), 230-265.
83. J. von Neumann, Theory of self-reproducing automata, University of Illinois Press, Urbana, Ill., 1966, (A. W. Burks, ed.).
84. S. Wolfram, Universality and complexity in cellular automata, Physica D. Nonlinear Phenomena 10 (1984), no. 1-2, 1-35, Cellular automata (Los Alamos, N.M., 1983).
85. S. Wolfram, A new kind of science, Wolfram Media Inc., Champaign, Ilinois, US, United States, 2002.
86. D. Woods and T. Neary, On the time complexity of 2-tag systems and small universal turing machines, FOCS 2006, IEEE Computer Society, 2006, pp. 439-448.
87. D. Woods and T. Neary, The complexity of small universal turing machines, Computability in Europe (S. B. Cooper, B. Lowe, and A. Sorbi, eds.), Lecture Notes in Computer Science, vol. 4497, Springer, 2007, pp. 791-799.