Abstract
The Kauffman model of genetic computation highlights the importance of criticality at the border of order and chaos. The model with connectivity one is of special interest because it is exactly solvable. But our understanding of its behavior is incomplete, and much of what we do know relies on heuristic arguments. Here, we show that the key quantities in the model are intimately related to aspects of number theory. Using these links, we derive improved bounds for the number of attractors as well as the mean attractor length, which is harder to compute. Our work suggests that number theory is the natural language for deducing many properties of the critical Kauffman model with connectivity one, and opens the door to further insight into this deceptively simple model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.