Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Problem Solving from Nature

PPSN 1998: Parallel Problem Solving from Nature — PPSN V pp 653–662Cite as

Simple + parallel + local = cellular computing

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1498))

Abstract

In recent years we are witness to a growing number of researchers who are interested in novel computational systems based on principles that are entirely different than those of classical computers. Though coming from disparate domains, their work shares a common computational philosophy, which I call cellular computing. Basically, cellular computing is a vastly parallel, highly local computational paradigm, with simple cells as the basic units of computation. It aims at providing new means for doing computation in a more efficient manner than other approaches (in terms of speed, cost, power dissipation, information storage, quality of solutions), while potentially addressing much larger problem instances than was possible before—at least for some application domains. This paper provides a qualitative exposition of the cellular computing paradigm, including sample applications and a discussion of some of the research issues involved.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021–1024, November 1994.

    Google Scholar 

  2. P. W. Anderson. More is different. Science, 177(4047):393–396, August 1972.

    Google Scholar 

  3. S. C. Benjamin and N. F. Johnson. A possible nanometer-scale computing device based on an adding cellular automaton. Applied Physics Letters, 70(17):2321–2323, April 1997.

    Article  Google Scholar 

  4. H.-H. Chou and J. A. Reggia. Problem solving during artificial selection of selfreplicating loops. Physica D, 115(3–4):293–312, May 1998.

    Article  MATH  Google Scholar 

  5. L. O. Chua and T. Roska. The CNN paradigm. IEEE Transactions on Circuits and Systems, 40(3):147–156, March 1993.

    MATH  MathSciNet  Google Scholar 

  6. L. O. Chua and L. Yang. Cellular neural networks: Applications. IEEE Transactions on Circuits and Systems, 35(10):1272–1290, October 1988.

    MATH  Google Scholar 

  7. L. O. Chua and L. Yang. Cellular neural networks: Theory. IEEE Transactions on Circuits and Systems, 35(10):1257–1271, October 1988.

    Article  MATH  MathSciNet  Google Scholar 

  8. V. Cimagalli and M. Balsi. Cellular neural networks: A review. In E. Caianiello, editor, Proceedings of Sixth Italian Workshop on Parallel Architectures and Neural Networks, Singapore, 1994. World Scientific.

    Google Scholar 

  9. M. Conrad. On design principles for a molecular computer. Communications of the ACM, 28(5):464–480, May 1985.

    Article  Google Scholar 

  10. M. Conrad and E. A. Liberman. Molecular computing as a link between biological and physical theory. Journal of Theoretical Biology, 98:239–252, 1982.

    Article  Google Scholar 

  11. P. Coveney and R. Highfield. Frontiers of Complexity: The Search for Order in a Chaotic World. Faber and Faber, London, 1995.

    Google Scholar 

  12. J. P. Crutchfield and M. Mitchell. The evolution of emergent computation. Proceedings of the National Academy of Sciences USA, 92(23):10742–10746, 1995.

    Article  MATH  Google Scholar 

  13. R. Deaton, R. C. Murphy, J. A. Rose, M. Garzon, D. R. Franceschetti, and S. E. Stevens, Jr. A DNA based implementation of an evolutionary search for good encodings for DNA computation. In Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC'97), pages 267–271, 1997.

    Google Scholar 

  14. W. D. Hillis. The Connection Machine. The MIT Press, Cambridge, Massachusetts, 1985.

    Google Scholar 

  15. K. Kaneko, I. Tsuda, and T. Ikegami, editors. Constructive Complexity and Artificial Reality, Proceedings of the Oji International Seminar on Complex Systems-from Complex Dynamical Systems to Sciences of Artificial Reality, volume 75, Nos. 1–3 of Physica D, August 1994.

    Google Scholar 

  16. C. G. Langton. Self-reproduction in cellular automata. Physica D, 10:135–144, 1984.

    Article  Google Scholar 

  17. R. J. Lipton. DNA solution of hard computational problems. Science, 268:542–545, April 1995.

    Google Scholar 

  18. M. Mitchell, J. P. Crutchfield, and P. T. Hraber. Evolving cellular automata to perform computations: Mechanisms and impediments. Physica D, 75:361–391, 1994.

    Article  MATH  Google Scholar 

  19. H. R. Pagels. The Dreams of Reason: The Computer and the Rise of the Sciences of Complexity. Bantam Books, New York, 1989.

    Google Scholar 

  20. J.-Y. Perrier, M. Sipper, and J. Zahnd. Toward a viable, self-reproducing universal computer. Physica D, 97:335–352, 1996.

    Article  MathSciNet  Google Scholar 

  21. J. Rebek, Jr. Synthetic self-replicating molecules. Scientific American, 271(1):48–55, July 1994.

    Article  Google Scholar 

  22. M. Sipper. Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Springer-Verlag, Heidelberg, 1997.

    Google Scholar 

  23. M. Sipper. Cellular computing. 1998. (Submitted).

    Google Scholar 

  24. M. Sipper and M. Tomassini. Co-evolving parallel random number generators. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature — PPSN IV, volume 1141 of Lecture Notes in Computer Science, pages 950–959. Springer-Verlag, Heidelberg, 1996.

    Google Scholar 

  25. M. Sipper and M. Tomassini. Generating parallel random number generators by cellular programming. International Journal of Modern Physics C, 7(2):181–190, 1996.

    Article  Google Scholar 

  26. M. Sipper, M. Tomassini, and O. Beuret. Studying probabilistic faults in evolved non-uniform cellular automata. International Journal of Modern Physics C, 7(6):923–939, 1996.

    Article  Google Scholar 

  27. G. Tempesti. A new self-reproducing cellular automaton capable of construction and computation. In F. Morán, A. Moreno, J. J. Merelo, and P. Chacón, editors, ECAL'95: Third European Conference on Artificial Life volume 929 of Lecture Notes in Computer Science, pages 555–563, Heidelberg, 1995. Springer-Verlag.

    Google Scholar 

  28. J. von Neumann. Theory of Self-Reproducing Automata. University of Illinois Press, Illinois, 1966. Edited and completed by A. W. Burks.

    Google Scholar 

  29. S. Wolfram. Cellular Automata and Complexity. Addison-Wesley, Reading, MA, 1994.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logic Systems Laboratory, Swiss Federal Institute of Technology, CH-1015, Lausanne, Switzerland

    Moshe Sipper

Authors
  1. Moshe Sipper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Agoston E. Eiben Thomas Bäck Marc Schoenauer Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sipper, M. (1998). Simple + parallel + local = cellular computing. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056907

Download citation

  • DOI: https://doi.org/10.1007/BFb0056907

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65078-2

  • Online ISBN: 978-3-540-49672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation