Skip to main content
SpringerLink
Log in

Universality and Cellular Automata

  • Conference paper
Machines, Computations, and Universality (MCU 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3354))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldwin, J.T., Shelah, S.: On the classifiability of cellular automata. Theoretical Computer Science 230(1-2), 117–129 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bennett, C.H.: Logical reversibility of computation. IBM journal of Research and Development, 525–532 (1973)

    Google Scholar 

  3. Bennett, C.H.: Time/space trade-offs for reversible computation. SIAM Journal on Computing, 766–776 (1989)

    Google Scholar 

  4. Culik, K., Yu, S.: Undecidability of CA classification schemes. Complex Systems 2(2), 177–190 (1988)

    MATH  MathSciNet  Google Scholar 

  5. Davis, M.: A note on universal Turing machines, pp. 167–175. Princeton University Press, Princeton (1956)

    Google Scholar 

  6. Davis, M.: The definition of universal Turing machines. In: Proc. of the American Mathematical Society, vol. 8, pp. 1125–1126 (1957)

    Google Scholar 

  7. Evans, K.M.: Is Bosco’s rule universal? In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 188–199. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Friedberg, R.M.: Two recursively enumerable sets of incomparable degrees of unsolvability. Proc. Natl. Acad. Sci. USA 43, 236–238 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  9. Harrington, L., Shelah, S.: The undecidability of the recursively enumerable degrees. Bull. Amer. Math. Soc. 6, 79–80 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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)

    MathSciNet  Google Scholar 

  11. Lerman, M.: Degrees of Unsolvability. Perspectives in Mathematical Logic. Springer, Heidelberg (1983)

    MATH  Google Scholar 

  12. Morita, K.: Reversible cellular automata. J. Information Processing Society of Japan 35, 315–321 (1994)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Muchnik, A.A.: On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Acad. Nauk SSSR 108, 194–197 (1956)

    MATH  Google Scholar 

  15. 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)

    Article  MATH  MathSciNet  Google Scholar 

  16. Soare, R.I.: The Friedberg-Muchnik theorem re-examined. Canad. J. Math. 24, 1070–1078 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  17. Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer, Heidelberg (1987)

    Google Scholar 

  18. Sutner, K.: A note on Culik-Yu classes. Complex Systems 3(1), 107–115 (1989)

    MATH  MathSciNet  Google Scholar 

  19. Sutner, K.: Classifying circular cellular automata. Physica D 45(1-3), 386–395 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sutner, K.: De Bruijn graphs and linear cellular automata. Complex Systems 5(1), 19–30 (1991)

    MATH  MathSciNet  Google Scholar 

  21. Sutner, K.: Cellular automata and intermediate reachability problems. Fundamentae Informaticae 52(1-3), 249–256 (2002)

    MATH  MathSciNet  Google Scholar 

  22. Sutner, K.: Almost periodic configurations on linear cellular automata (2003) (to appear)

    Google Scholar 

  23. Sutner, K.: Cellular automata and intermediate degrees. Theoretical Computer Science 296, 365–375 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sutner, K.: The complexity of reversible cellular automata. Theoretical Computer Science 325(2), 317–328 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  25. Toffoli, T., Margolus, N.: Injective cellular automata. Physica D 45(1-3), 386–395 (1990)

    Article  MathSciNet  Google Scholar 

  26. Wolfram, S.: Computation theory of cellular automata. Comm. Math. Physics 96(1), 15–57 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  27. Wolfram, S.: The Mathematica Book. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  28. Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    K. Sutner

Authors
  1. K. Sutner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IUT de Metz, LITA, Université Paul Verlaine - Metz, EA 3097, UFR MIM, Île du Saulcy, 57045, Metz, Cédex, France

    Maurice Margenstern

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation