Revision as of 12:49, 11 April 2003 edit 217.37.214.121 (talk) italics, Markov, A.A. ← Previous edit		Revision as of 12:49, 11 April 2003 edit undo 217.37.214.121 (talk) oops. Next edit →
Line 1: A '''Markov algorithm''' is a [[string rewriting system]] that uses [[grammar]]-like rules to operate on [[string]]s 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]]. References:

Markov algorithm: Difference between revisions