Answers are grounded in this paper and cite their sources.
Kauffman's model is a random complex automata where nodes are randomly assembled. Each node σi receives K inputs from K randomly chosen nodes and the values of σi at time t + 1 is a random Boolean function of the K inputs at time t. Numerical simulations have shown that the behaviour of this model is very different for K > 2 and K ⩽ 2. It is the purpose of this work to give a simple annealed approximation which predicts K = 2 as the critical value of K. This approximation gives also quantitative predictions for distances between iterated configurations. These predictions agree rather well with the numerical simulations. A possible way of improving this annealed approximation is proposed.
No takes yet. Share an insight, caveat, or question.
Derrida et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: