Is Randomness "Native" to Computer Science?

Simple item page
dc.creatorFerbus-Zanda, Marie
dc.creatorGrigorieff, Serge
dc.date2008-01-01
dc.date.accessioned2026-07-07T08:52:04Z
dc.date.available2026-07-07T08:52:04Z
dc.descriptionWe survey the Kolmogorov's approach to the notion of randomness through the Kolmogorov complexity theory. The original motivation of Kolmogorov was to give up a quantitative definition of information. In this theory, an object is randomness in the sense that it has a large information content. Afterwards, we present parts of the work of Martin-Lof, Schnorr, Chaitin and Levin which supply a mathematical notion of randomness throughout diverse theories from the the 60' up to recently.
dc.description43 pages
dc.identifierhttps://arxiv.org/abs/0801.0289
dc.identifierhttp://arxiv.org/abs/0801.0289
dc.identifierCurrent Trends in Theoretical Computer Science. Vol2, World Scientific (Ed.) (2004) 141-180
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145156
dc.subjectLogic
dc.subjectComputational Complexity
dc.titleIs Randomness "Native" to Computer Science?
dc.typetext

Files

Collections

arXiv