Kolmogorov complexity and non-determnism

Authors:
Serge Grigorieff;Jean-Yves Marion
Affiliations:
Univ. Paris 7, Paris, France;Univ. Nancy 2, Vandœuvre-lés-Nancy, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 5
Cited 0

Randomness conservation inequalities; information and independence in mathematical theories

Information and Control
Instance complexity

Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
Computability and complexity: from a programming perspective

Computability and complexity: from a programming perspective
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)

Quantified Score

Hi-index	5.23

Visualization

Abstract

We are concerned with Kolmogorov complexity of strings produced by non-deterministic algorithms. For this, we consider five classes of non-deterministic description modes: (i) non-bounded description modes in which the number of outputs depends on programs, (ii) distributed description modes in which the number of outputs depends on the size of the outputs, (iii) spread description modes in which the number of outputs depends on both programs and the size of the outputs, (iv) description modes for which each string has a unique minimal description, and lastly (v) description modes for which the set of minimal length descriptions is a prefix set.