Title: Emergent Phenomena and Complexity
Source: Alife IV, also available electronically
Comments: Emergence is defined in terms of a notion of predictive complexity, by comparing the complexity of the computation with and without knowledge of the regularities in the system under study. Hence emergence implies computational irreducibility. Complexity here, is the sum of the Kolmogorov complexity of its steps.
Keywords: EMERGENCE, COMPUTATIONAL, KOLMOGOROV, COMPLEXITY,
| Top | Authors | Journals | Years | Keywords | Search | New | Comments |