An Algorithm for Intercell Communication in a Tesselated Automaton
暂无分享,去创建一个
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.
[1] John H. Holland,et al. Iterative circuit computers , 1960, IRE-AIEE-ACM '60 (Western).
[2] John von Neumann,et al. Theory Of Self Reproducing Automata , 1967 .
[3] C. C. Foster,et al. Parallel execution of iterative algorithms , 1965 .
[4] Jon S. Squire,et al. Programming and design considerations of a highly parallel computer , 1963, AFIPS '63 (Spring).