|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 5 of 16 found articles
| Title: |
A Simple Proof of Miller-Yu Theorem |
| Author: |
Bienvenu, Laurent Merkle, Wolfgang Shen, Alexander |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 83 (2008) nr. 1-2 pages 21-24 |
| Year: |
2008-05-27 |
| Contents: |
A few years ago a nice criterion of Martin-Löf randomness in terms of plain (neither prefix nor monotone) Kolmogorov complexity was found (among many other results, it is published in [5]). In fact Martin-Löf came rather close to the formulation of this criterion around 1970 (see [4] and [7], p. 98); a version of it that involves both plain and prefix complexity1 was proven by Gacs in 1980 ([2], remark after corollary 5.4 on p. 391). We provide a simple proof of this criterion that uses only elementary arguments very close to the original proof of Levin-Schnorr criterion of randomness (1973) in terms of monotone complexity ([3, 6]). |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 5 of 16 found articles
| << previous | next >> |