Content deleted Content added
Semifinalist (talk | contribs) →Algorithm: clarifying |
Semifinalist (talk | contribs) Formal grammar |
||
Line 1:
A '''[[Andrey Markov (Soviet mathematician)|Markov]] algorithm''' is a [[string rewriting system]] that uses [[Formal grammar|grammar]]-like rules to operate on [[string (computer science)|strings]] of symbols. Markov algorithms have been shown to be [[Turing-complete]], which means that they are suitable as a general model of [[computation]] and can represent any [[mathematical expression]] from its simple notation.
[[Refal]] is a [[programming language]] based on '''Markov algorithm'''.
| |||