𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

✍ Scribed by Laurent Bienvenu

Publisher
Springer
Year
2009
Tongue
English
Weight
503 KB
Volume
46
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Feasible reductions to kolmogorov-lovela
Feasible reductions to kolmogorov-loveland stochastic sequences
✍ Jack H. Lutz; David L. Schweizer πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 620 KB

For every binary sequence A, there is an infinite binary sequence S such that A <ft S and S is stochastic in the sense of Kolmogorov and Loveland.

Quantum Kolmogorov Complexity
Quantum Kolmogorov Complexity
✍ AndrΓ© Berthiaume; Wim van Dam; Sophie Laplante πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 184 KB

In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the