Is Randomness "Native" to Computer Science?
Logic
2008-01-03 v1 Computational Complexity
Abstract
We 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.
Cite
@article{arxiv.0801.0289,
title = {Is Randomness "Native" to Computer Science?},
author = {Marie Ferbus-Zanda and Serge Grigorieff},
journal= {arXiv preprint arXiv:0801.0289},
year = {2008}
}
Comments
43 pages