Abstract
The idea that two-dimensional data arrays could be processed by matching arrays of computers was first introduced by von Neumann (1951). It was not until the paper by Unger (1958) that it was seriously proposed to construct such an array. Unger proposed using simple one-bit computers (processing elements) and, although Unger’s work inspired many subsequent proposals (e.g., McCormick, 1963), it took some fifteen years for technology to develop to the point where array construction was an economic proposition.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer Science+Business Media New York
About this chapter
Cite this chapter
Preston, K., Duff, M.J.B. (1984). Array Automata. In: Modern Cellular Automata. Advanced Applications in Pattern Recognition. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0393-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-4899-0393-8_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-0395-2
Online ISBN: 978-1-4899-0393-8
eBook Packages: Springer Book Archive