Randomness and reducibility (2001)
Cached
Download Links
- [www.math.uchicago.edu]
- [math.uchicago.edu]
- DBLP
Other Repositories/Bibliography
by
Rod G. Downey
,
Denis R. Hirschfeldt
,
Geoff Laforte
| Venue: | J. Comput. System Sci |
| Citations: | 19 - 4 self |
BibTeX
@ARTICLE{Downey01randomnessand,
author = {Rod G. Downey and Denis R. Hirschfeldt and Geoff Laforte},
title = {Randomness and reducibility},
journal = {J. Comput. System Sci},
year = {2001},
volume = {68},
pages = {316--327}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same degrees of randomness”, what does the resulting structure look like? The goal of this paper is to look at questions like these, specifically by studying the properties of reducibilities that act as
Citations
| 27 | Randomness in computability theory - Ambos-Spies, Kučera - 1999 |
| 16 | Calude, Information and Randomness: An Algorithmic Perspective, 2nd Edition (Springer-Verlag - S - 2002 |
| 15 | Weakly computable real numbers - Ambos-Spies, Weihrauch, et al. |
| 13 | Degree-theoretic aspects of computably enumerable reals - Calude, Coles, et al. - 1999 |
| 10 | Program-size complexity of initial segments and domination reducibility - Calude, Coles - 1999 |
| 5 | Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set - Barzdins - 1968 |
| 1 | Calude, A characterization of c.e. random reals, Theoret - S - 2002 |
