Kolmogorov complexity and non-determinism - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2002

Kolmogorov complexity and non-determinism


We are concerned with Kolmogorov complexity of strings produced by non-deterministic algorithms. For this, we consider four classes of non-deterministic description modes : (i) Description modes in which the number of outputs computed by a program is finite, (ii) description modes in which the set of outputs is sparse, (iii) description modes for which each string has a unique minimal description, and lastly (iv) description modes for which the set of minimal length description is a prefix set.
Not file

Dates and versions

inria-00100709 , version 1 (26-09-2006)



Serge Grigorieff, Jean-Yves Marion. Kolmogorov complexity and non-determinism. Theoretical Computer Science, 2002, 271 (1-2), pp.151-180. ⟨10.1016/S0304-3975(01)00038-X⟩. ⟨inria-00100709⟩
60 View
0 Download



Gmail Facebook Twitter LinkedIn More