Markov algorithms: A universal model of computation


Markov algorithms are one of several universal models of computation. Computation is modeled as a deterministic transformation of an input string into an output string.

A Markov algorithm consists of

Execution

Always use the first rule that applies to the data string, apply it at the leftmost pattern match.
When a terminal rule is executed or no rule applies, execution stops.

How to use