Content deleted Content added
→External links: - removed dead link |
fix links to point to page about A.A.Markov (Jr.), not his father |
||
Line 1:
A '''[[Andrey Markov (Soviet mathematician)|Markov]] algorithm''' is a [[string rewriting system]] that uses [[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'''.
Line 61:
==References==
* Caracciolo di Forino, A. ''String processing languages and generalized Markov algorithms.'' In Symbol manipulation languages and techniques, D. G. Bobrow (Ed.), North-Holland Publ. Co., Amsterdam, The Netherlands, 1968, pp. 191-206.
* [[Andrey Markov (Soviet mathematician)|Andrey Andreevich Markov (1903-1979)]] 1960. ''The Theory of Algorithms.'' American Mathematical Society Translations, series 2, 15, 1-14.
==External links==
| |||