Antichaos in a Class of Random Boolean Cellular Automata

Nonlinear Sciences – Adaptation and Self-Organizing Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages. A uuencoded, tar-compressed postscipt file containing figures has been added

Scientific paper

10.1016/0167-2789(93)90190-C

A variant of Kauffman's model of cellular metabolism is presented. It is a randomly generated network of boolean gates, identical to Kauffman's except for a small bias in favor of boolean gates that depend on at most one input. The bias is asymptotic to 0 as the number of gates increases. Upper bounds on the time until the network reaches a state cycle and the size of the state cycle, as functions of the number of gates $n$, are derived. If the bias approaches 0 slowly enough, the state cycles will be smaller than $n^c$ for some $c<1$. This lends support to Kauffman's claim that in his version of random network the average size of the state cycles is approximately $n^{1/2}$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Antichaos in a Class of Random Boolean Cellular Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Antichaos in a Class of Random Boolean Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Antichaos in a Class of Random Boolean Cellular Automata will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-600570

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.