Emergent computation using a new model of cellular automata
Yasser Fouad Hassan, Eiichiro Tazaki · Applied Artificial Intelligence · 2003
In recent years, an approach-termed emergence system has gained popularity in a variety of fields, however, emergent behavior in decentralized spatially extended systems, such as in Cellular Automata, is still not well understood. The difficulties we face in adopting a definition of the concept of emergence are reminiscent of the complications faced by early Artificial Intelligence (AI) researchers in defining intelligence. Emergent computation allows the constraints of the task to be represented more naturally and permits only pertinent task-specific knowledge to emerge in the course of solving the problem. For accepting that a system is displaying emergent behavior, the system should be constructed by describing local elementary interactions between components in a different way than describing global behavior and properties of the running system over a period of time. In this paper, we introduce a general model for describing the emergent computational strategies.