Abstract | ||
---|---|---|
We present a first formal analysis of specific and complete local integration. Complete local integration was previously proposed as a criterion for detecting entities or wholes in distributed dynamical systems. Such entities in turn were conceived to form the basis of a theory of emergence of agents within dynamical systems. Here, we give a more thorough account of the underlying formal measures. The main contribution is the disintegration theorem which reveals a special role of completely locally integrated patterns (what we call i-entities) within the trajectories they occur in. Apart from proving this theorem we introduce the disintegration hierarchy and its refinement- free version as a way to structure the patterns in a trajectory. Furthermore, we construct the least upper bound and provide a candidate for the greatest lower bound of specific local integration. Finally, we calculate the i-entities in small example systems as a first sanity check and find that i-entities largely fulfil simple expectations. |
Year | DOI | Venue |
---|---|---|
2017 | 10.3390/e19050230 | ENTROPY |
Keywords | Field | DocType |
identity over time,Bayesian networks,multi-information,entity,persistence,integration,emergence,naturalising agency | Mathematical optimization,Upper and lower bounds,Infimum and supremum,Algorithm,Theoretical computer science,Dynamical systems theory,Bayesian network,Disintegration theorem,Hierarchy,Trajectory,Mathematics | Journal |
Volume | Issue | ISSN |
19 | 5 | 1099-4300 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Martin Biehl | 1 | 23 | 5.15 |
Takashi Ikegami | 2 | 229 | 62.61 |
Daniel Polani | 3 | 549 | 70.25 |