Kolmogorov complexity and non-determinism - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

Kolmogorov complexity and non-determinism


We are concerned with Kolmogorov complexity of strings produced by non-deterministic algorithms. For this, we consider binary recursively enumerable relations, named description modes. We give conditions on the class of description modes to provide a Kolmogorov entropy. Within this framework, we prove that there is a proper hierarchy of such non-deterministic modes. Then, we give a sharp estimation on the amount of information to turn a deterministic mode into a non-deterministic one, and inversely. Lastly, we show that deterministic modes are less efficient than non-deterministic modes from some rank.
No file

Dates and versions

inria-00098564 , version 1 (25-09-2006)


  • HAL Id : inria-00098564 , version 1


Serge Grigorieff, Jean-Yves Marion. Kolmogorov complexity and non-determinism. [Intern report] 98-R-274 || grigorieff98a, 1998, 11 p. ⟨inria-00098564⟩
58 View
0 Download


Gmail Facebook Twitter LinkedIn More