H ? « ‹ ← → › »

Language peer sets for Markov:
Russian Federation↑
Russian Federation/1920↑
Designed 1920 ↑
1920s languages ↑
Pre-Computing↑
Pre-War↑
Genus Symbolic ↑
Symbolic↑
Logical↑
Expression-oriented ↑
Symbolic/1920↑
Logical/1920↑
Expression-oriented/1920↑
Symbolic/Russian Federation↑
Logical/Russian Federation↑
Expression-oriented/Russian Federation↑

Markov(ID:2211/mar007)

Markov's algorithms

alternate simple view

Country: Russian Federation
Designed 1920
Genus: Symbolic

"A Markov algorithm is a string rewriting system that uses grammar-like rules to operate on strings 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 it is Turing-complete, Markov chains can represent any mathematical expression from its simple notation."

Related languages

Markov	→	CLIPS	Influence
Markov	→	PANON	Based on
Markov	→	SNOBOL	Influence

References:

Markov, A.A. (1960) Markov, A.A. 1960. The Theory of Algorithms. American Mathematical Society Translations, series 2, 15, 1-14.

Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE ACM portal CiteSeer CSB ncstrl jstor Bookfinder