Abstract
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram’s “Principle of Computational Equivalence”. We discuss a classification for cellular automata that is based on computably enumerable degrees. In this setting the full structure of the semilattice of the c.e. degrees is inherited by the cellular automata.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldwin, J.T., Shelah, S.: On the classifiability of cellular automata. Theoretical Computer Science 230(1-2), 117–129 (2000)
Bennett, C.H.: Logical reversibility of computation. IBM journal of Research and Development, 525–532 (1973)
Bennett, C.H.: Time/space trade-offs for reversible computation. SIAM Journal on Computing, 766–776 (1989)
Culik, K., Yu, S.: Undecidability of CA classification schemes. Complex Systems 2(2), 177–190 (1988)
Davis, M.: A note on universal Turing machines, pp. 167–175. Princeton University Press, Princeton (1956)
Davis, M.: The definition of universal Turing machines. In: Proc. of the American Mathematical Society, vol. 8, pp. 1125–1126 (1957)
Evans, K.M.: Is Bosco’s rule universal? In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 188–199. Springer, Heidelberg (2005)
Friedberg, R.M.: Two recursively enumerable sets of incomparable degrees of unsolvability. Proc. Natl. Acad. Sci. USA 43, 236–238 (1957)
Harrington, L., Shelah, S.: The undecidability of the recursively enumerable degrees. Bull. Amer. Math. Soc. 6, 79–80 (1982)
Lecerf, Y.: Machine de Turing réversible. Insolubilité réecursive en n ∈ N de l’équation u = ènu, où è est un isomorphisme de codes. C. R. Acad. Sci. Paris 257, 2597–2600 (1963)
Lerman, M.: Degrees of Unsolvability. Perspectives in Mathematical Logic. Springer, Heidelberg (1983)
Morita, K.: Reversible cellular automata. J. Information Processing Society of Japan 35, 315–321 (1994)
Morita, K., Harao, M.: Computation universality of 1 dimensional reversible (injective) cellular automata. Transactions Institute of Electronics, Information and Communication Engineers E 72, 758–762 (1989)
Muchnik, A.A.: On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Acad. Nauk SSSR 108, 194–197 (1956)
Shepherdson, J.C.: Machine configuration and word problems of given degree of unsolvability. Z. f. Math. Logik u. Grundlagen d. Mathematik 11, 149–175 (1965)
Soare, R.I.: The Friedberg-Muchnik theorem re-examined. Canad. J. Math. 24, 1070–1078 (1972)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer, Heidelberg (1987)
Sutner, K.: A note on Culik-Yu classes. Complex Systems 3(1), 107–115 (1989)
Sutner, K.: Classifying circular cellular automata. Physica D 45(1-3), 386–395 (1990)
Sutner, K.: De Bruijn graphs and linear cellular automata. Complex Systems 5(1), 19–30 (1991)
Sutner, K.: Cellular automata and intermediate reachability problems. Fundamentae Informaticae 52(1-3), 249–256 (2002)
Sutner, K.: Almost periodic configurations on linear cellular automata (2003) (to appear)
Sutner, K.: Cellular automata and intermediate degrees. Theoretical Computer Science 296, 365–375 (2003)
Sutner, K.: The complexity of reversible cellular automata. Theoretical Computer Science 325(2), 317–328 (2004)
Toffoli, T., Margolus, N.: Injective cellular automata. Physica D 45(1-3), 386–395 (1990)
Wolfram, S.: Computation theory of cellular automata. Comm. Math. Physics 96(1), 15–57 (1984)
Wolfram, S.: The Mathematica Book. Cambridge University Press, Cambridge (2002)
Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sutner, K. (2005). Universality and Cellular Automata. In: Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2004. Lecture Notes in Computer Science, vol 3354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31834-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-31834-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25261-0
Online ISBN: 978-3-540-31834-7
eBook Packages: Computer ScienceComputer Science (R0)