Marie Ferbus-Zanda

According to our database, Marie Ferbus-Zanda authored at least 11 papers between 2001 and 2010.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2010

Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes

Marie Ferbus-Zanda, Serge Grigorieff

CoRR, 2010

Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality

Marie Ferbus-Zanda

CoRR, 2010

ASMs and Operational Algorithmic Completeness of Lambda Calculus.

Marie Ferbus-Zanda, Serge Grigorieff

Proceedings of the Fields of Logic and Computation, 2010

2008

Kolmogorov complexity in perspective

Marie Ferbus-Zanda, Serge Grigorieff

CoRR, 2008

Set theoretical Representations of Integers, I

Marie Ferbus-Zanda, Serge Grigorieff

CoRR, 2008

Kolmogorov complexities Kmax, Kmin on computable partially ordered sets

Marie Ferbus-Zanda, Serge Grigorieff

CoRR, 2008

Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities

Marie Ferbus-Zanda, Serge Grigorieff

CoRR, 2008

Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity

Marie Ferbus-Zanda, Serge Grigorieff

CoRR, 2008

2006

Kolmogorov complexities <i>K</i>_max, <i>K</i>_min on computable partially ordered sets.

Marie Ferbus-Zanda, Serge Grigorieff

Theor. Comput. Sci., 2006

Kolmogorov complexity and set theoretical representations of integers.

Marie Ferbus-Zanda, Serge Grigorieff

Math. Log. Q., 2006

2001

Is Randomness "Native" to Computer Science?

Marie Ferbus-Zanda, Serge Grigorieff

Bull. EATCS, 2001