This is turing complete

The README states

We lose Turing completeness because our new procedure is not deterministic, but practice shows that this formalism still allows to describe a huge range of interesting random processes.

But you can create a deterministic system with strict enough patterns.

Example of conways game of life in an async CA https://www.youtube.com/watch?v=oXiqMGhn9rk&t=749s

Rule 110 (which is turing complete) implemented in MarkovJunior:

https://github.com/mxgmn/MarkovJunior/assets/54243225/8e8aa845-fa32-428f-9392-0173e338e5ab

rule_110.xml