Cellular automata models with complex valued transition functions

The new class of mathematical models for computation theory is considered — namely cellular automata (CA) with branching complex-valued transition functions. The key point is possible multivaluedness of cell’s states with such transition functions. Different cases with complex-value transition functions had been considered. Dynamics CA on one branch and on different isolated branches are described. Also the case of transitions of states between branches is proposed. The case of continuous-valued CA and their finite-valued approximations are discussed. The problem of approximation of multivalued CA is stated.

Multivaluedness in Cellular Automata with Strong Anticipation and Some Prospects for Computation Theory

It is considered the general formulations and properties of cellular automata with cells which have the strong anticipatory property (introduced by D. Dubois). Multivalued behavior (hyperincursion) of solutions of such CA is described. It was posed new research problems of computation theory related to presumable multivaluedness of cellular automata with strong anticipation property. Extending of classical automata, Turing machine and algorithms had been proposed. Also some relation of such cellular automata and quantum mechanics are discussed.