title: Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.
abstract: We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.
authors.affiliation: Department of Sociology, University of Nebraska-Lincoln, Lincoln, Nebraska, USA.
authors.forename: Bilal
authors.initials: B
authors.lastname: Khan
authors.affiliation: Department of Computer Science, The Graduate Center, City University of New York, USA.
authors.forename: Yuri
authors.initials: Y
authors.lastname: Cantor
authors.affiliation: Department of Sociology, University of Nebraska-Lincoln, Lincoln, Nebraska, USA.
authors.forename: Kirk
authors.initials: K
authors.lastname: Dombrowski
keywords: Attractor-based obstructions; Cyclic boolean automata; Robustness; Synchronous boolean