Abstract
Experiments on random binary, ternary, etc. (P=2, 3,…, 10) switching nets are reported. Behavioral cycle lengths are examined as functions of output variety,P, input connectance,K, and net size,N. Overall, output variety appears an influential, well-behaved net property. Strong, but well-behaved interactions appear among net variables. In high connectance nets, median cycle length grows approx. asPN/2. Other factors constant, one-connected nets show the shortest cycles, and connectance effects appear to converge asymptotically aroundN. Data for cycle length as a function of net size suggest a concavity not compatible with the Kauffman “square root law” (Kauffman, 1969). Evidence of a positive relationship between cycle length and run-in length is found in two-input nets; weaker evidence is obtained that in higher connectance nets this relationship becomes negative in sign. The “modular complexity” ofP>2 nets is examined briefly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
