Kolmogorov complexity in perspective

Simple item page
dc.creatorFerbus-Zanda, Marie
dc.creatorGrigorieff, Serge
dc.date2008-01-02
dc.date.accessioned2026-07-07T08:52:08Z
dc.date.available2026-07-07T08:52:08Z
dc.descriptionWe survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes back to the 60's with the work of Martin-Lof, Schnorr, Chaitin, Levin), and classification, which is a recent idea with provocative implementation by Vitanyi and Cilibrasi.
dc.description37 pages
dc.identifierhttps://arxiv.org/abs/0801.0354
dc.identifierhttp://arxiv.org/abs/0801.0354
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145176
dc.subjectLogic
dc.subjectComputational Complexity
dc.subjectInformation Theory
dc.titleKolmogorov complexity in perspective
dc.typetext

Files

Collections

arXiv