NetLogo User Community Models
(back to the NetLogo User Community Models)
If clicking does not initiate a download, try right clicking or control clicking and choosing "Save" or "Download".
Try It in NetLogo Web
MODEL Determinable Complexity
With this model it is possible to generate some thousands of patterns that, incidentally, bear a
reasonable likeness to printed circuit boards. However the model is intended to illustrate that a
complex and apparently random pattern may not be an indeterminable collection of marks, and may be
made by a procedure that is repeatable.
In the case of a pattern generated from a seed pattern by a stepped procedure of many steps, it is
easier to conclude that it may be determinable if the seed pattern is symmetrical and some of those
generated in the model are; but it requires a feat of memory to check with any certainty by running
the same seed pattern sequentially more than once.
In this model two pattern generators operate concurrent and usually with different seed patterns;
but there is provision to run them with the same seed pattern as an illustration of the determinacy.
RUNNING THE MODEL
Press SETUP-DIFFERENT-SEEDS to see the two seed patterns in the centers of the two display areas.
Press RUN to see 180 patterns in both displays generated in sequence from the seeds.
Press SETUP-SAME-SEEDS to see the two pattern generators working with the same seed pattern.
Press RUN to see 180 patterns in both displays generated in sequence from the seed.
Press RUN again to PAUSE the run, so that the patterns can be compared.
Given that these patterns are determinable, is it possible to construct and run a procedure that would
step by step take a pattern back to the original seed, with or without knowledge of that original seed?
The author Derek Rush may be contacted by Email at firstname.lastname@example.org May 2003.