Tuesday, August 12, 2008

Stuart Kaufmann's Random Boolean Networks

take N nodes that can be on or off. hook 'em together into a network with various logical gates coming into each one with an average of k inputs from the others. look at the ensemble of all such possible systems.

let each cycle synchronously, the nodes turning each other on and off. there ought to be 2^N possible states to such a system. Kaufmann found that when K is around 2 most of the systems end up falling into one of a MERE sqrt(N) possible attractive cycles! the systems do not explore anywhere NEAR the 2^N possible states.

No comments: