Its really cool stuff and you'll no doubt love it if you're keen on that stuff. He's also got a youtube channel under his name that is really worth checking out.
https://direct.mit.edu/isal/proceedings/isal2020/32/13/98482
Feel like a bit of an amateur with my previous landscape architecture art driven by a cellular automaton: https://hyperobjects.design/artwork/rule-30-city
(width iterations) ← 127 64 ⍝ perfect size for a nice sierpinski
advance ← {2|-⌿¯1 1⊖⍤0 1⊢⍵} ⍝ on a torus
x←width⍴0 ⋄ x[⌊width÷2] ← 1
{⎕←' ⌹'[⍵]⋄advance ⍵}⍣iterations⊢x
And the random variant (not as pretty, but still has some nice triangles): {⎕←' ⌹'[⍵]⋄advance ⍵}⍣iterations ?width⍴2It is an open problem if there is a language that can be recognized after 2|w|-1 iterations, but not after |w|-1 iterations. Afaik, it is even unknown if there is any language in NP that cannot be recognized after |w|-1 steps (obviously P!=NP would imply this). I'm surprised how far math has come, but how little we know about computational complexity.
As a warning, that stuff is a little controversial, to say the least.
https://www.amazon.com/Cellular-Automata-F-Codd/dp/148321174...
by Edgar F. Codd the inventor of relational databases.
https://hn.algolia.com/?dateRange=all&page=0&prefix=true&que...
We detached this comment from https://news.ycombinator.com/item?id=26895428.