Emergent phenomena in cellular automata modeling

It has recently been shown that an approach termed emergence system has gained popularity in a variety of fields, however, emergent computation in decentralized spatially extended systems, such as in cellular automata, is still not well understood. To accept that a system is displaying emergent behavior, the system should be constructed by describing local elementary interactions between components. This is achieved in a different way by describing global behavior and properties of the running system over a period of time. This paper introduces the emergent computational paradigm, and discusses its theoretical formulation using a new general model of cellular automata. We have also developed a technique to study the structure of the state transition of cellular automata in the limit of large system size.