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 be a general model of computation, and can thus be shown to be equivalent to a in power to a Turing machine.