Surprising Areas in the Quest for Small Universal Devices

Electronic Notes in Theoretical Computer Science

Volumn 225, Issue C, 2009, Pages 201-220

  Margenstern, Maurice ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

cellular automata; hyperbolic geometry; super Turing computations; Turing machines; universality

Indexed keywords

MACHINERY; PATTERN RECOGNITION SYSTEMS; ROBOTS; TRANSLATION (LANGUAGES); TURING MACHINES;

DO-MAINS; HYPERBOLIC GEOMETRY; SUPER-TURING COMPUTATIONS; UNIVERSALITY;

CELLULAR AUTOMATA;

EID: 58149295749     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.12.075     Document Type: Article

References (36)

1. Amoroso S., and Patt Y. Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures. Journal of Computer and System Sciences 6 (1972) 448-464
2. Berlekamp E.R., Conway J.H., and Guy R.K. Winning Ways for your Mathematical Plays (1982), Academic Press, London
3. Codd E.F. Cellular automata (1968), Academic Press
4. Cook M. Universality in Elementary Cellular Automata. Complex Systems 15 1 (2004) 1-40
5. J. Durand-Lose, Representing Reversible Cellular Automata with Reversible Block Cellular Automata, DM-CCG 2001, (2001), 145-154
6. Grigorieff S., and Margenstern M. Register Cellular Automata in the Hyperbolic Plane. Fundamenta Informaticae 61 1 (2004) 19-27
7. Hedlund G. Endomorphisms and automorphisms of shift dynamical systems. Math. Systems Theory 3 (1969) 320-375
8. Herrmann F., and Margenstern M. A universal cellular automaton in the hyperbolic plane. Theoretical Computer Science 296 2 (2003) 327-364
9. Imai K., and Morita K. A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theoretical Computer Science 231 (2000) 181-191
10. Kari J. Reversibility of 2D cellular automata is undecidable. Physica D 45 (1990) 379-385
11. Kudlek M. Small Deterministic Turing Machines. Theoretical Computer Science 168-2 (1996) 241-255
12. Kudlek M., and Rogozhin Yu. A universal Turing machine with 3 states and 9 symbols. Lecture Notes in Computer Science 2295 (2001) 311-318
13. Lindgren K., and Nordahl M.G. Universal computation in simple one-dimensional cellular automata. Complex Systems 4 (1990) 299-318
14. Margenstern M. New tools for cellular automata in the hyperbolic plane. Journal of Universal Computer Science 6 12 (2000) 1226-1252
15. Margenstern M. On the Infinigons of the Hyperbolic Plane, A combinatorial approach. Fundamenta Informaticae 56 3 (2003) 255-272
16. Margenstern M., A universal cellular automaton with five states in the 3D hyperbolic space, International Journal of Unconventional Computations, to appear
17. Margenstern M. An algorithm for building intrinsically universal cellular automata in hyperbolic spaces. Proceedings of FCS'06 (2006), CSREA Press. 1-60132-015-9 3-9
18. Margenstern M., and Morita K. A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. Journal of Universal Computations and Systems 5 (1999) 563-573
19. Margenstern M., and Pavlotskaya L.M. On the optimal number of instructions for universal Turing machines connected with a finite automaton. International Journal of Algebra and Computation 13 2 (2003) 133-202
20. Minsky M.L. Computation: Finite and Infinite Machines (1967), Prentice Hall, Englewood Cliffs, N.J.
21. Moore E.F. Machine Models of Self-reproduction. Proceedings of the Symposium in Applied Mathematics 14 (1962) 17-33
22. Morita K. A simple construction method of a reversible finite automaton out of Fredkin gates, and its related model. Transaction of the IEICE E (1990) 978-984
23. Myhill J. The Converse to Moore's Garden-of-Eden Theorem. Proceedings of the American Mathematical Society 14 (1963) 685-686
24. Neary T., Small polynomial time universal Turing machines, MFCSIT'06, Cork, August, 1-5, 2006
25. Neary T., and Woods D. Four Small Universal Turing Machines. Proceedings of MCU'2007. Lecture Notes in Computer Science 4664 (2007) 242-254
26. Ollinger N. The Quest for Small Universal Cellular Automata. ICALP'2002. Lecture Notes in Computer Science 2380 (2002) 318-329
27. Pavlotskaya L.M. Razreshimost' problemy ostanovki dlja nekotorykh klassov mashin T'juringa. Matematicheskie Zametki 13 6 (1973) 899-909
28. transl. Solvability of the halting problem for certain classes of Turing machines. Notes of the Acad. Sci. USSR 13 6 (Nov. 1973) 537-541
29. Pavlotskaya L.M. Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring. Avtomaty i mashiny (1978) 91-118 (Sufficient conditions for halting problem decidability of Turing machines) (in Russian)
30. Post E.L. Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic 12 (1947) 1-11
31. Rogozhin Yu.V. Small universal Turing machines. Theoretical Computer Science 168-2 (1996) 215-240
32. Serizawa T. Three-state Neumann neighbour cellular automata capable of constructing self-reproducing machines. Systems and Computers in Japan 18 4 (1987) 33-40
33. Stewart I. A subway named Turing. Scientific American 271 3 (September 1994) 90-92
34. Toffoli T. Computation and Construction Universality of Reversible Cellular Automata. J. Comput. Syst. Sci. 15 2 (1977) 213-231
35. Watanabe S. 5-symbol 8-state and 5-symbol 6-state universal Turing machines. Journal of the ACM 8 4 (1961) 476-483
36. Woods D., T. Neary, On the time complexity of 2-tag-systems and small universal Turing machine, FOCS'2006, Berkeley, October, 22-24, 2006