Skip to main content
Log in

AECAM: An extension matrix algorithm on a cellular automata machine

  • Short Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A simplified version of the extension matrix algorithm has been proved to be useful for implementation on a cellular automata machine (CAM-6). The algorithm and its implementation are described.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Califano, Andrea, Margolus, N., and Toffoli, T., CAM-6: A High Performance Cellular Automata Machine. Users Guide. MIT Lab for Computer Science, Cambridge Mass., 1987.

    Google Scholar 

  2. Farmer, D., Toffoli, T. and Wolfram, S., eds., Cellular Automata. North-Holland, 1984.

  3. Hayes, B., The cellular automaton offers a model of the world and a world unto itself.Scientific American, 1984, 250 (3), 12–21.

    Article  Google Scholar 

  4. Hong, J.R., AE1: An Extension Matrix Approximate Method for the General Covering Problem. Intl. J. Computer and Information Science, December 1985.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Y., Hong, J., D'Andrea, V. et al. AECAM: An extension matrix algorithm on a cellular automata machine. J. of Comput. Sci. & Technol. 7, 88–91 (1992). https://doi.org/10.1007/BF02946171

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation