Main Page | See live article | Alphabetical index

Markov algorithm

A Markov algorithm is a string rewriting system that uses grammar-like rules to operate on strings of symbols. Markov algorithms have been shown to have sufficient power to be a general model of computation, and can thus be shown to be equivalent in power to a Turing machine. Since it is Turing-complete, Markov chains can represent any mathematical expression from its simple notation.

References:

External link