2012•Unpublished venueRequires access

Is Randomness native to Computer Science? Ten Years Later

Marie Ferbus-Zanda, Serge Grigorieff

Abstract

2 What we have learned? A personal pick 4 2.1 From randomness to complexity . . . . . . . . . . . . . . . . . . . . . 4 2.2 Formalization of randomness: infinite strings . . . . . . . . . . . . . 5 2.3 Random versus lawless . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.4 Randomness and finite strings: incompressibility . . . . . . . . . . . 7 2.5 Representation and Kolmogorov complexity . . . . . . . . . . . . . . 8 2.6 Prefix-freeness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.7 Approximating randomness and Kolmogorov complexity . . . . . . . 11

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Randomness, Kolmogorov complexity, Randomness tests, Representation (politics), Prefix, Computer science, Mathematics, Theoretical computer science