Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Multi-Resolution Cellular Automata for Real Computation

  • Conference paper
Models of Computation in Context (CiE 2011)

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

Included in the following conference series:

Abstract

This paper introduces multi-resolution cellular automata (MRCA), a multi-resolution variant of cellular automata. Cells in an MRCA are allowed to “fission” one or more times during the course of execution. At any given time, the MRCA may thus be carrying out computations on a variety of spatial scales. Our main theorem uses the MRCA model to give a natural characterization of the computability of sets in Euclidean space, provided that their boundaries are computably nowhere dense.

This research was supported in part by National Science Foundation Grants 0652569 and 0728806.

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. Brattka, V., Weihrauch, K.: Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science 219, 65–93 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Braverman, M.: On the complexity of real functions. In: Forty-Sixth Annual IEEE Symposium on Foundations of Computer Science, pp. 155–164 (2005)

    Google Scholar 

  3. Braverman, M., Cook, S.: Computing over the reals: Foundations for scientific computing. Notices of the AMS 53(3), 318–329 (2006)

    MathSciNet  MATH  Google Scholar 

  4. Burks, A.: Essays on Cellular Automata. Univeristy of Illinois Press, US (1970)

    MATH  Google Scholar 

  5. Carroll, L.: Alice’s Adventures in Wonderland. Project Gutenberg (2008)

    Google Scholar 

  6. Copeland, B.J.: Accelerating Turing machines. Minds and Machines 12, 281–301 (2002)

    Article  MATH  Google Scholar 

  7. Griffeath, D., Moore, C.: New Constructions in Cellular Automata. Oxford University Press, USA (2003)

    MATH  Google Scholar 

  8. Grzegorczyk, A.: Computable functionals. Fundamenta Mathematicae 42, 168–202 (1955)

    MathSciNet  MATH  Google Scholar 

  9. Hamkins, J.D., Lewis, A.: Infinite time Turing machines. Journal of Symbolic Logic 65(2), 567–604 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ko, K., Friedman, H.: Computational complexity of real functions. Theoretical Computer Science 20, 323–352 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ko, K.-I.: Complexity Theory of Real Functions. Birkhäuser, Boston (1991)

    Book  MATH  Google Scholar 

  12. Kreitz, C., Weihrauch, K.: Complexity theory on real numbers and functions. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol. 145, pp. 165–174. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  13. Lacombe, D.: Extension de la notion de fonction recursive aux fonctions d’une ow plusiers variables reelles, and other notes. Comptes Rendus (1955), 240:2478-2480; 241:13-14, 151-153, 1250-1252

    Google Scholar 

  14. McIntosh, H.V.: One Dimensional Cellular Automata. Luniver Press, United Kingdom (2009)

    Google Scholar 

  15. Myrvold, W.C.: The decision problem for entanglement. In: Cohen, R.S., Horne, M.S.J. (eds.) Potentiality, Entanglement and Passion-at-a-Distance: Quantum Mechanical Studies for Abner Shimony, pp. 177–190. Kluwer Academic Publishers, Dordrecht and Boston (1997)

    Chapter  Google Scholar 

  16. Parker, M.W.: Undecidability in ℝn: Riddled basins, the KAM tori, and the stability of the solar system. Philosophy of Science 70, 359–382 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  17. Parker, M.W.: Three concepts of decidability for general subsets of uncountable spaces. Theoretical Computer Science 351, 2–13 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Heidelberg (1989)

    Book  MATH  Google Scholar 

  19. Schaller, M., Svozil, K.: Scale-invariant cellular automata and self-similar Petri nets. The European Physical Journal B 69, 297–311 (2009)

    Article  Google Scholar 

  20. Schiff, J.: Cellular Automata: A Discrete View of the World. Wiley Interscience, USA (2008)

    MATH  Google Scholar 

  21. Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42(2), 230–265 (1936)

    MathSciNet  MATH  Google Scholar 

  22. Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. A correction. Proc. London Math. Soc. 43(2), 544–546 (1936)

    MATH  Google Scholar 

  23. Turing, A.M.: Systems of Logic Based on Ordinals. Ph.D. thesis, Princeton, New Jersey, USA (1938)

    Google Scholar 

  24. Weihrauch, K.: Computability. Springer, New York (1987)

    Book  MATH  Google Scholar 

  25. Weihrauch, K.: Computable Analysis. An Introduction. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  26. Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign, Illinois, USA (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Iowa State University, Ames, IA, 50011, United States of America

    James I. Lathrop, Jack H. Lutz & Brian Patterson

Authors
  1. James I. Lathrop
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jack H. Lutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Brian Patterson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Logic, Language and Computation, University of Amsterdam, 1090, Amsterdam, GE, The Netherlands

    Benedikt Löwe

  2. Department of Mathematics, University of Oslo, 0316, Oslo, Norway

    Dag Normann

  3. Department of Mathematical Logic and Applications, Sofia University, 1164, Sofia, Bulgaria

    Ivan Soskov  & Alexandra Soskova  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lathrop, J.I., Lutz, J.H., Patterson, B. (2011). Multi-Resolution Cellular Automata for Real Computation. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21875-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21874-3

  • Online ISBN: 978-3-642-21875-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation