Revision as of 11:39, 16 June 2003 edit 195.226.138.36 (talk) No edit summary ← Previous edit		Revision as of 04:05, 2 March 2004 edit undo Andris (talk \| contribs) 4,835 edits m Markov chain => Markov algorithm, those are completely different 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 to be a general model of [[computation]], and can thus be shown to be equivalent in power to a [[Turing machine]]. Since itthis model is [[Turing-complete]], [[Markov ~~chain]]s~~algorithms can represent any [[mathematical expression]] from its simple notation. References:

Markov algorithm: Difference between revisions