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.
References
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.
Farmer, D., Toffoli, T. and Wolfram, S., eds., Cellular Automata. North-Holland, 1984.
Hayes, B., The cellular automaton offers a model of the world and a world unto itself.Scientific American, 1984, 250 (3), 12–21.
Hong, J.R., AE1: An Extension Matrix Approximate Method for the General Covering Problem. Intl. J. Computer and Information Science, December 1985.
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946171