Universality and cellular automata

Lecture Notes in Computer Science

Volumn 3354, Issue , 2005, Pages 50-59

  Sutner, K ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DISCRETE TIME CONTROL SYSTEMS;

CELLULAR AUTOMATA; DISCRETE DYNAMICAL SYSTEMS; UNIVERSALITY;

AUTOMATA THEORY;

EID: 24144458569     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31834-7_4     Document Type: Conference Paper

References (28)

1. J. T. Baldwin and S. Shelah. On the classifiability of cellular automata. Theoretical Computer Science, 230(1-2):117-129, 2000.
2. C. H. Bennett. Logical reversibility of computation. IBM journal of Research and Development, pages 525-532, 1973.
3. C. H. Bennett. Time/space trade-offs for reversible computation. SIAM Journal on Computing, pages 766-776, 1989.
4. K. Culik and Sheng Yu. Undecidability of CA classification schemes. Complex Systems, 2(2):177-190, 1988.
5. M. Davis. A note on universal Turing machines, pages 167-175. Princeton University Press, 1956.
6. M. Davis. The definition of universal Turing machines. Proc. of the American Mathematical Society, 8:1125-1126, 1957.
7. K. M. Evans. Is Bosco's rule universal? In MCU'04, Sankt Petersburg, 2004.
8. R. M. Friedberg. Two recursively enumerable sets of incomparable degrees of unsolvability. Proc. Natl. Acad. Sci. USA, 43:236-238, 1957.
9. L. Harrington and S. Shelah. The undecidability of the recursively enumerable degrees. Bull. Amer. Math. Soc., 6:79-80, 1982.
10. nu, où θ est un "isomorphisme de codes". C. R. Acad. Sci. Paris, 257:2597-2600, 1963.
11. M. Lerman. Degrees of Unsolvability. Perspectives in Mathematical Logic. Springer Verlag, 1983.
12. K. Morita. Reversible cellular automata. J. Information Processing Society of Japan, 35:315-321, 1994.
13. K. Morita and M. Harao. Computation universality of 1 dimensional reversible (injective) cellular automata. Transactions Institute of Electronics, Information and Communication Engineers, E, 72:758-762, 1989.
14. A. A. Muchnik. On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Acad. Nauk SSSR, 108:194-197, 1956.
15. J. C. Shepherdson. Machine configuration and word problems of given degree of unsolvability. Z. f. Math. Logik u. Grundlagen d. Mathematik, 11:149-175, 1965.
16. R. I. Soare. The Friedberg-Muchnik theorem re-examined. Canad. J. Math., 24:1070-1078, 1972.
17. R. I. Soare. Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer Verlag, 1987.
18. K. Sutner. A note on Culik-Yu classes. Complex Systems, 3(1): 107-115, 1989.
19. K. Sutner. Classifying circular cellular automata. Physica D, 45(1-3):386-395, 1990.
20. K. Sutner. De Bruijn graphs and linear cellular automata. Complex Systems, 5(1):19-30, 1991.
21. K. Sutner. Cellular automata and intermediate reachability problems. Fundamentae Informaticae, 52(1-3) :249-256, 2002.
22. K. Sutner. Almost periodic configurations on linear cellular automata. To appear, 2003.
23. K. Sutner. Cellular automata and intermediate degrees. Theoretical Computer Science, 296:365-375, 2003.
24. K. Sutner. The complexity of reversible cellular automata. Theoretical Computer Science, 325(2):317-328, 2004.
25. T. Toffoli and N. Margolus. Injective cellular automata. Physica D, 45(1-3):386-395, 1990.
26. S. Wolfram. Computation theory of cellular automata. Comm. Math. Physics, 96(1):15-57, 1984.
27. S. Wolfram. The Mathematica Book. Cambridge University Press, 2002.
28. S. Wolfram. A New Kind of Science. Wolfram Media, 2002.