Parallel computations on the lower level in the negabinaries coding system are considered. All arithmetical operations are realized by means of five simple rules. Every rule represents the inversion of a certain combination of bits on a cellular plane. The notion of cellular program is introduced. The independence of a computational result of the solitary defects of cells is investigated. Examples illustrate this approarch. The questions concerning the property of rule systems are discussed.
Keywords: theory
Source:
V. Valkovskii, D. Zerbino, Computations on Cellular Automata with Defects. In V. Malyshkin (ed.),
Parallel Computing Technologies: Proceedings of the 4th International Conference,
Lect. Notes in Comp. Sci., Vol. 1277, Springer, 1997, pp. 136-144
