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.;
