Skip to main content

Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing

  • Conference paper
Unconventional Computation (UC 2005)

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

Included in the following conference series:

Abstract

This paper deals with a kind of hybrid system that is obtained by making cellular automata infinitely small. Each point on a continuous space is defined as a state transition system with a finite number of discrete states that changes its state according to its previous state and the states of its neighbors. Time is also defined as continuous, so that state transitions may propagate through the space continuously over time. Discrete state transitions can be made instantaneously, as in the case of ordinary hybrid systems. It turned out that even defining the global behaviors that satisfy local transition rules is not trivial. The framework that we propose here can be regarded as a framework for amorphous computing.

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

Access this chapter

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. Alur, R., Courcoubetis, C., Halbwacks, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 3–34 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Abelson, H., Allen, D., Coore, D., Hanson, C., Homsy, G., Knight Jr., T.F., Nagpal, R., Rauch, E., Sussman, G.J., Weiss, R.: Amorphous computing. Communications of the ACM 43(5), 74–82 (2000)

    Article  Google Scholar 

  3. Berec, L.: Techniques of spatially explicit individual-based models: construction simulation, and mean-field analysis. Ecological Modelling 150, 55–81 (2002)

    Article  Google Scholar 

  4. Osam, R., Rubin, J., Curtu, R., Ermentrout, B.: Traveling waves in a one-dimensional integrate-and-fire neural network with finite support connectivity. Neurocomputing 52–54, 869–875 (2003)

    Google Scholar 

  5. Takeuti, I.: Transition systems over continuous time-space. Electronic Notes in Theoretical Computer Science 120, 173–186 (2005)

    Article  MathSciNet  Google Scholar 

  6. Tokihiro, T., Takahashi, D., Matsukidaira, J., Satsuma, J.: From soliton equations to integrable cellular automata through a limiting procedure. Physical Review Letters 76(18), 3247–3250 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hagiya, M. (2005). Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_12

Download citation

  • DOI: https://doi.org/10.1007/11560319_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29100-8

  • Online ISBN: 978-3-540-32022-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics