Kauffman cracked

Number of attractors in the critical Kauffman model is exponential

In a remarkable series of advances, researchers have honed in on how the number of attractors in a critical Kauffman model grows with network size $N$. But a definitive answer has proved elusive. We show that, for the model with connectivity one, the number of attractors grows at least, and at most, as $(2/$√$e)^N$. This is the first proof that the number of attractors in a critical Kauffman model grows exponentially.