Abstract
A simple program for constructing a cellular self-reproducing rectangular loop of arbitrary size is developed based on the parallel substitution algorithm (PSA), which provides a spatial model for representing fine-grained parallel computations. In order to launch the self-reproduction of a loop of some specified size, one should enter its description into the input tape. The program includes operators for preliminary cleaning the cellular array, which makes it possible to easily change its internal functional structure. Two variants of the program are developed. The first variant constructs a chain of self-reproducing loops of the given size, and the second variant constructs an array of such loops.
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.
