Kolmogorov complexity and non-determinism

Serge Grigorieff 1 Jean-Yves Marion 2
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00100709
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:49:54 PM
Last modification on : Friday, April 12, 2019 - 10:18:03 AM

Identifiers

  • HAL Id : inria-00100709, version 1

Citation

Serge Grigorieff, Jean-Yves Marion. Kolmogorov complexity and non-determinism. Theoretical Computer Science, Elsevier, 2002, 271 (1-2), pp.151-180. ⟨inria-00100709⟩

Share

Metrics

Record views

147