Towards a stable definition of algorithmic randomness - Archive ouverte en Histoire etPhilosophie des Sciences et des Techniques Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Towards a stable definition of algorithmic randomness

Résumé

Although information content is invariant up to an additive constant, the range of possible additive constants applicable to programming languages is so large that in practice it plays a major role in the actual evaluation of K(s), the Kolmogorov complexity of a string s. We present a summary of the approach we've developed to overcome the problem by calculating its algorithmic probability and evaluating the algorithmic complexity via the coding theorem, thereby providing a stable framework for Kolmogorov complexity even for short strings. We also show that reasonable formalisms produce reasonable complexity classifications.

Mots clés

Fichier non déposé

Dates et versions

halshs-00792292 , version 1 (21-02-2013)

Identifiants

  • HAL Id : halshs-00792292 , version 1

Citer

Hector Zenil. Towards a stable definition of algorithmic randomness. Seminar on Algorithmic Randomness, May 2011, Paris, France. ⟨halshs-00792292⟩
217 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More