A Formal Model Based on Affinity Among Elements for Describing Behavior of Complex Systems
Kazuto Tominaga · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · 2004
The field of studies on complex systems is becoming one of the most active research areas in computer science. Among those systems, there is a type of system that has the following characteristics: comprising a large number of unintelligent elements, composition and decomposition of groups of elements, and simple but various interactions among the elements. In this paper, we present a formal model for describing the behavior of such type of complex system. The presented model is based on pattern matching, recombination of elements, and nondeterminism. We give example descriptions for several systems, which include a simple self-replicating creature, Turing machines, and a solver of the 3SAT problem.