Specifying Updating Orders

https://en.wikipedia.org/wiki/Evaluation_strategy

SubstitutionSystem[ ]

Sequential substitution systems

https://www.wolframscience.com/nks/notes-3-6--order-of-replacements-in-sequential-substitution-systems/

https://www.wolframscience.com/nks/notes-9-11--confluence-in-string-rewriting/

Sequential cellular automata

https://www.wolframscience.com/nks/notes-9-10--sequential-cellular-automata/

Could be equivalent to CellularAutomaton[ ] if the rule is confluent....

StringReplace[ ], Replace[ ] etc.

These do single-pass evaluation on a given expression

WolframModel[ ]

[[ What is its notion of a generation? ]]

Aggregation models

When is there confluence in aggregation models?

Non-deterministic Turing machines

In[]:=

RulePlot[TuringMachine[2323]]

Out[]=

An NDTM just has extra cases.

[[ computational trees of NDTMs ?? ]]

https://en.wikipedia.org/wiki/Computation_tree

{

s

i

,

a

i

}->{

sp

i

,

ap

i

,

off

i

}

Sequential CA Scheme