Computations on cellular automata with defects
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 dis ussed.
Unable to display preview. Download preview PDF.