Coarse reducibility and algorithmic randomness

Journal of Symbolic Logic 81 (3):1028-1046 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Computing from projections of random points.Noam Greenberg, Joseph S. Miller & André Nies - 2019 - Journal of Mathematical Logic 20 (1):1950014.
Algorithmic randomness and measures of complexity.George Barmpalias - 2013 - Bulletin of Symbolic Logic 19 (3):318-350.
A C.E. Real That Cannot Be SW-Computed by Any Ω Number.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (2):197-209.

Analytics

Added to PP
2017-04-05

Downloads
28 (#588,332)

6 months
18 (#152,314)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Gamma question for many-one degrees.Matthew Harrison-Trainor - 2017 - Annals of Pure and Applied Logic 168 (7):1396-1405.
Computing from projections of random points.Noam Greenberg, Joseph S. Miller & André Nies - 2019 - Journal of Mathematical Logic 20 (1):1950014.

Add more citations

References found in this work

Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.

Add more references