Faculty Member, Department of Statistics, Kashan University, Iran
Abstract
Given the importance of Markov chains in information theory, the definition of the conditional probability of this stochastic process can also be defined in terms of mutual information. This article clarifies the relationship between the concept of sufficiency and Markov chains from the perspective of information theory principles, as well as the relationship between probabilistic sufficiency and algorithmic sufficiency.
Shams, M. (2017). Probabilistic Sufficiency and Algorithmic Sufficiency from the Perspective of Information Theory. Andishe_ye Amari, 22(1), 1-10.
MLA
Shams, M. "Probabilistic Sufficiency and Algorithmic Sufficiency from the Perspective of Information Theory", Andishe_ye Amari, 22, 1, 2017, 1-10.
HARVARD
Shams M. (2017). 'Probabilistic Sufficiency and Algorithmic Sufficiency from the Perspective of Information Theory', Andishe_ye Amari, 22(1), pp. 1-10.
CHICAGO
M. Shams, "Probabilistic Sufficiency and Algorithmic Sufficiency from the Perspective of Information Theory," Andishe_ye Amari, 22 1 (2017): 1-10,
VANCOUVER
Shams M. Probabilistic Sufficiency and Algorithmic Sufficiency from the Perspective of Information Theory. Andishe_ye Amari. 2017;22(1):1-10 (In Persian).
