Simple automata

Array programming
1

https://isaac-flath.github.io/APL-Exploration/posts/NewScience.html

I wrote a post on simple automata like those discussed by stephen wolfram in a new kind of science. The programming is pretty cool and in dyalog the unicode capabilities make nifty visualizations pretty easy.

For example if you have a character array of the unicode black square and white square. You can index into it and visualize binary arrays. The post shows one example of how you can use this to great effect.

      ⎕←colors←'■□'
┌→─┐
│■□│
└──┘
      colors⌷⍨⊂1 0 1 1 0 0 1
┌→──────┐
│□■□□■■□│
└───────┘
3 Likes
2

image
Did you visualize the above chart based on the logic below?
image

3

No those are two different rules.

The chart says

000->0
001->0
010->1
011->0
100->0
101->0
110->0
111->1

It is rule 33. The right side is 33 expressed in binary with leading 0s padding it out to 8 bits.

33=00100001

The logic is rule 7.
7=00000111