DocumentCode
1115631
Title
On Some Open Problems in the Theory of Cellular Automata
Author
Kosaraju, S. Rao
Author_Institution
Department of Electrical Engineering, The Johns Hopkins University
Issue
6
fYear
1974
fDate
6/1/1974 12:00:00 AM
Firstpage
561
Lastpage
565
Abstract
Some open problems in the theory of cellular automata are considered: the tradeoff between machine complexity and interconnection complexity, linear time pattern recognition and transformation problems, and the noncomputability of the constant of linearity of linear time problems.
Keywords
Cellular automata, complexity tradeoffs, interconnection complexity, machine complexity, neighborhood reduction, packing, parallel processing, pattern recognition, pattern transformation.; Automata; Hydrogen; Linearity; Parallel processing; Pattern recognition; Terminology; Topology; Cellular automata, complexity tradeoffs, interconnection complexity, machine complexity, neighborhood reduction, packing, parallel processing, pattern recognition, pattern transformation.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.223995
Filename
1672588
Link To Document