Is Randomness "native" to Computer Science?

Is Randomness "native" to Computer Science? (2003)

Cached

Download Links

[www.liafa.jussieu.fr]

by Marie Ferbus-Zanda , Serge Grigorieff

Citations:

4 - 3 self

BibTeX

@MISC{Ferbus-Zanda03israndomness,
    author = {Marie Ferbus-Zanda and Serge Grigorieff},
    title = {Is Randomness "native" to Computer Science? },
    year = {2003}
}

Bookmark

OpenURL

Abstract

Citations

1577	An Introduction to Probability Theory and Its Applications Volume I. 3rd edition - Feller - 1968
1412	An Introduction to Kolmogorov Complexity and Its Applications - Li, Vitanyi - 1997
592	The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition - Knuth - 1997
397	Three approaches to the quantitative definition of information - Kolmogorov - 1965
294	The definition of random sequences - Martin-Löf
274	A theory of program size formally identical to information theory - Chaitin - 1975
264	Algorithmic Information Theory - Chaitin - 1987
186	On the length of programs for computing finite binary sequences - Chaitin - 1966
123	Algorithmic randomness and complexity - Downey, Hirschfeldt - 2010
98	An Introduction to the General Theory of Algorithms - MACHTEY, YOUNG - 1978
93	Mathematical logic as based on the theory of types - Russell - 1908
91	On the notion of a random sequence - Levin - 1973
86	Randomness conservation inequalities: Information and independence in mathematical theories - Levin - 1984
77	A unified approach to the definition of random sequences - Schnorr - 1971
58	Randomness and recursive enumerability - Slaman
41	On partial randomness - Calude, Staiger, et al.
40	The combinatorial foundations of information theory and the probability calculus - Kolmogorov - 1983
39	A variant of the Kolmogorov concept of complexity - Loveland - 1969
33	Incompleteness theorems for random reals - Chaitin - 1987
29	On initial segment complexity and degrees of randomness - Miller, Yu
28	Recursively enumerable reals and Chaitin Ω numbers, Theoret - Calude, Hertling, et al.
28	On tables of random numbers - Kolmogorov - 1998
23	Algorithms and randomness - Kolmogorov, Uspensky - 1987
21	Complexity of oscilations in infinite binary sequences - Martin-Löf - 1971
18	Lectures notes on descriptional complexity and randomness - Gács - 1993
15	A highly random number - Becher, Chaitin, et al. - 2001
6	Kolmogorov complexity and lower bounds - Paul - 1979
5	Another example of higher order randomness - Becher, Chaitin
4	Information theoretic characterizations of infinite strings - Chaitin - 1976
4	Kolmogorov complexity and set theoretical representations of integers - Ferbus-Zanda, Grigorieff - 2006
4	On tables of random numbers. Sankhya, The Indian - Kolmogorov - 1963
3	Computational complexity and gödel incompleteness theorem - Chaitin - 1971
2	Grundbegriffe der Wahscheinlichkeitsrechnung - Kolmogorov - 1933
2	Kolmogorov complexity and its applications. Lecture - Shen
1	Computational complexity and Gdel incompleteness theorem - Chaitin - 1971
1	Kolmogorov complexities kmin, kmax on computable partially ordered sets. Theoret - Ferbus, Grigorieff
1	Kolmogorov complexity and nondeterminism - Grigorieff, Marion
1	The Logic in Computer Science Column: On Kolmogorov machines and related issues - Gurevich - 1988
1	Some theorems about algorithmic entropy and algorithmic information - Kolmogorov - 1968
1	A new interpretation of von Mises’s concept of random sequence - Loveland - 1966
1	Possibly infinite computations : random reals - Becher, Grigorieff
1	Possibly infinite computations and higher order randomness - Becher, Grigorieff
1	Kolmogorov complexity and nondeterminism - Grigorieff, Marion