| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6873964 | Information and Computation | 2015 | 13 Pages |
Abstract
The nine combinations of (a)-(c) and (i)-(iii) define nine variants of computable randomness. We provide a complete characterization of the relations between these notions, and show that they form five linearly ordered classes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ron Peretz,