Local SIMD paradigm for programming differentiation and growth (Ron Weiss)

• Each computing element’s state includes some binary markers. Each computing element’s program has many independent rules.

• Rules are triggered when messages are received. A rule is applicable if a certain boolean combination of markers is satisfied.

• When a rule is applied it may set markers and send further messages.

• Messages have hop counts that determine how far they will diffuse.

• Markers may have lifetimes after which they expire.

Previous slide

Next slide

Back to first slide

View graphic version