3 citations · 6 across the 9 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2010★ 1 cited
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
Marie Ferbus-Zanda, Serge Grigorieff
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rando…
cs.LO2010
ASMs and Operational Algorithmic Completeness of Lambda Calculus
Marie Ferbus-Zanda, Serge Grigorieff
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any…
cs.LO2010
Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality
Marie Ferbus-Zanda
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rando…