Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Is Randomness "Native" to Computer Science? (0801.0289v1)

Published 1 Jan 2008 in math.LO and cs.CC

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Marie Ferbus-Zanda (9 papers)
  2. Serge Grigorieff (19 papers)
Citations (11)

Summary

We haven't generated a summary for this paper yet.