An Algorithm for Intercell Communication in a Tesselated Automaton

Authors:
Fanya S. Montalvo;Caxton C. Foster
Affiliations:
Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01002.;Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01002.
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 4
Cited 0

Parallel execution of iterative algorithms

Parallel execution of iterative algorithms
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Iterative circuit computers

IRE-AIEE-ACM '60 (Western) Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference
Programming and design considerations of a highly parallel computer

AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference

Quantified Score

Hi-index	14.98

Visualization

Abstract

An algorithm is presented which permits any arbitrary subset of the cells of a content addressable tresselated automaton (CATA) to communicate with any other arbitrary subset.