Abstract

“Dissident” sites in random Boolean automata always differ from all their four nearest neighbors. We check how their number decreases if for each such site the rule which it obeys is inverted in regular intervals. We updated 0.9 sites per nanosecond on one NEC-SX3 processor; for simple one-dimensional exclusive-or automata, we updated 14 sites per nanosecond.

Full Text
Paper version not known

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 call

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.