References

1. Jurgen Albert & Karel Culik II (1987): A simple universal cellular automaton and its one-way and totalistic version. Complex Systems 1(1), pp. 1–16.
2. E.F. Codd (1968): Cellular Automata. Academic Press.
3. M. Cook (2004): Universality in Elementary Cellular Automata. Complex Systems 15(1), pp. 1–40.
4. Alvy Smith III (1971): Simple computation-universal cellular spaces. Journal of the Association for Computing Machinery (ACM) 18(3), pp. 339–353, doi:10.1145/321650.321652.
5. M. Margenstern (2007): Cellular Automata in Hyperbolic Spaces, volume I : Theory, first edition, Advances in Unconventional Computing and Cellular Automata, Editor: Andrew Adamatzky 1. Old City Publishing-Édition des archives contemporaines, Philadelphia, PA, USA - Paris, France.
6. M. Margenstern (2008): Cellular Automata in Hyperbolic Spaces, volume II : Implementation and Computations, first edition, Advances in Unconventional Computing and Cellular Automata, Editor: Andrew Adamatzky 2. Old City Publishing-Édition des archives contemporaines, Philadelphia, PA, USA - Paris, France.
7. M. Margenstern (2012): Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halting Problem. In: N. JONOSKA J. DURAND-LOSE: Unconventional Computation and Natural Computation 7445. UCNC 2012. Springer, pp. 12–33, doi:10.1007/978-3-642-32894-7_5.
8. M. Margenstern (2013): Small Universal Cellular Automata, A Collection of Jewels, first edition, Emergence, Complexity and Computation. Springer, doi:10.1007/978-3-642-36663-5.
9. K. Lindgren M.G. Nordahl (1990): Universal Computations in Simple One-Dimensional Cellular Automata. Complex Systems 4, pp. 299–318.
10. M. L. Minsky (1967): Computation: Finite and Infinite Machines, first edition, Advances in Unconventional Computing and Cellular Automata, Editor: Andrew Adamatzky 2. Prentice Hall, Englewood Cliffs, N.J., USA.
11. Cocke J. Minsky M. (1964): Universality of tag systems with P=2. Journal of the ACM 11(1), pp. 15–20, doi:10.1145/321203.321206.
12. R.M. Robinson (1991): Minsky's small universal Turing machine. International Journal of Mathematics 2(5), pp. 551–562, doi:10.1142/S0129167X91000302.
13. Yu. V. Rogozhin (1982): Sem' Universal'nykh mashin Tjuringa. Matematicheskie Issledovanija 69(2), pp. 76–90. Seven universal Turing machines (in Russian).
14. Yu. V. Rogozhin (1996): Small Universal Turing Machines. Theoretical Computer Science 168(2), pp. 215–240, doi:10.1016/s0304-3975(96)00077-1.
15. S. Wolfram (2002): A New Kind of Science. Wolfram Media.
16. T. Neary & D. Woods (2012): The Compexity of Small Universal Turing Machines: A Survey 7147. SOFSEM 2012. Springer, pp. 385–405, doi:10.1007/978-3-642-27660-6_32.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org