Content deleted Content added
Link to Markov chain |
No edit summary |
||
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 to in power to a [[Turing machine]]. Since it is [[Turing-complete]], [[Markov chain]]s can represent any [[mathematical expression]] from its simple notation.
References:
| |||