Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Valkovskii V.A., Zerbino D.D. The realization of arithmetical computation in alternative codes on cellular automata.-Problems of Information and Control, No 2, 1997.
Vittorio Grunwald, Giornale di matematiche di Battaglini, 23 (1885), 203–221.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valkovskii, V., Zerbino, D. (1997). Computations on cellular automata with defects. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-63371-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63371-6
Online ISBN: 978-3-540-69525-7
eBook Packages: Springer Book Archive