3 citations · 6 across the 9 of their papers we have counts for
9 papers
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…
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…
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…
Kolmogorov complexity in perspective
Marie Ferbus-Zanda, Serge Grigorieff
We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented n…
Set theoretical Representations of Integers, I
Marie Ferbus-Zanda, Serge Grigorieff
We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov comp…
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets
Marie Ferbus-Zanda, Serge Grigorieff
We introduce a machine free mathematical framework to get a natural formalization of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, t…