Machine Complexity Versus Interconnection Complexity in Iterative Arrays

DOI10.1109/T-C.1971.223238MaRDI QIDQ5625086zbMATH OpenFDO

Authors V. Carl Hamacher

Publication date 1971

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1971.223238

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Cited in

(4)

• Survey of research in the theory of homogeneous structures and their applications
• Iterative arrays with direct central control
• Two-dimensional cellular automata and their neighborhoods
• PROCESSES AND THEIR INTERACTIONS

This page was built for publication: Machine Complexity Versus Interconnection Complexity in Iterative Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625086)