The Dynamical Edge of Chaos
Candidate Law #1:
The Dynamical Edge of Chaos
"Communities of autonomous agents will evolve to the dynamical "edge of chaos" within and between members of the community, thereby simultaneously achieving an optimal coarse graining of each agent's world that maximizes the capacity of each agent to discriminate and act without trembling hands."
--Stuart Kauffman
Kauffman describes three colloraries to evaluate the truth of this Law in particular networks. Or perhaps they are better thought of as the undergirdings which produce the Law:
- K (the number of inputs per node) = 2 more frequently than would be likely in a random network
- Derrida's P is tuned for values of K greater than 2 to keep the network within the ordered regime
- A higher fraction of nodes are canalized than would be likely in a random network
See also Math and Candidate Laws for Coevolving Systems
— Scotus - 02 Jun 2002
