Carlos Gershenson, Stuart A. Kauffman and Ilya Shmulevich
have written a new paper named "The Role of Redundancy in
the Robustness of Random Boolean Networks", see
http://arxiv.org/abs/nlin.AO/0511018They say that "the addition of redundant nodes to RBNs
increases their robustness" and also that "redundancy is
a way of 'smoothing' fitness landscapes". Can you smooth
rugged fitness landscapes by redundancy ? Intersting.
Further they argue that "therefore redundancy can
facilitate evolutionary searches. However, too much
robustness could reduce the rate of adaptation of an
evolutionary process."
Do you think they are right?
-J.
Locked
