Kolmogorov Complexity and Solovay Functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Kolmogorov Complexity and Solovay Functions


Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) ≤ f (x)+O(1) for all x and f (x) ≤ K(x) + O(1) for infinitely many x, which we call Solovay functions. We show that Solovay functions present interesting connections with randomness notions such as Martin-Löf randomness and K-triviality.
Fichier principal
Vignette du fichier
bienvenu_new.pdf (224.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00359056 , version 1 (05-02-2009)


  • HAL Id : inria-00359056 , version 1
  • ARXIV : 0902.1041


Laurent Bienvenu, Rodney Graham Downey. Kolmogorov Complexity and Solovay Functions. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.147-158. ⟨inria-00359056⟩


49 View
156 Download



Gmail Facebook Twitter LinkedIn More