Title :
Theory of Markov´s Normal Algorithms
Author :
Raja, Ch ; Sathya, G. ; Rajan, E.G.
Author_Institution :
Dept. of ECE, Mahatma Gandhi Inst. of Tech, Hyderabad, India
Abstract :
This paper presents the concept of Normal Algorithms proposed by Andreii Andreevich Markov (A. A. Markov) in 1951. This concept is analogous to that of Turing machines introduced by Alan Mathaison Turing. A mathematical object of analysis is called computable if and only if it is Turing computable. One can also define computability in terms of normal algorithms.
Keywords :
Turing machines; computability; Markov normal algorithms; computability; mathematical object; turing computable; turing machines; Algorithm design and analysis; Filtering; Guidelines; Markov processes; Signal processing; Signal processing algorithms; Transforms; Normal algorithms; Recursively enumerable languages; Turing machines; computability;
Conference_Titel :
Computing Sciences (ICCS), 2012 International Conference on
Conference_Location :
Phagwara
Print_ISBN :
978-1-4673-2647-6
DOI :
10.1109/ICCS.2012.72
