Bulletin of Symbolic Logic 12 (3):390-410 (2006)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.2178/bsl/1154698740 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 69,979
External links
- From the Publisher via CrossRef (no proxy)
- citeseerx.ist.psu.edu
(no proxy) - projecteuclid.org (no proxy)
- projecteuclid.org [2] (no proxy)
- projecteuclid.org [3] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- jstor.org [4] (no proxy)
- cambridge.org (no proxy)
- math.ucla.edu (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
Calibrating Randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
Computational Randomness and Lowness.Sebastiaan A. Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
Relativizing Chaitin's Halting Probability.Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller & André Nies - 2005 - Journal of Mathematical Logic 5 (02):167-192.
Lowness Properties and Approximations of the Jump.Santiago Figueira, André Nies & Frank Stephan - 2008 - Annals of Pure and Applied Logic 152 (1):51-66.
View all 17 references / Add more references
Citations of this work BETA
Demuth Randomness and Computational Complexity.Antonín Kučera & André Nies - 2011 - Annals of Pure and Applied Logic 162 (7):504-513.
Benign Cost Functions and Lowness Properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.
Π 1 0 Classes, L R Degrees and Turing Degrees.George Barmpalias, Andrew E. M. Lewis & Frank Stephan - 2008 - Annals of Pure and Applied Logic 156 (1):21-38.
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
Computing K-Trivial Sets by Incomplete Random Sets.Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kučera, Joseph S. Miller, André Nies & Dan Turetsky - 2014 - Bulletin of Symbolic Logic 20 (1):80-90.
View all 19 citations / Add more citations
Similar books and articles
Computability, Proof, and Open-Texture.Stewart Shapiro - 2007 - In ¸ Iteolszewskietal:Cta. pp. 420--55.
Lowness and $\pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
Analytics
Added to PP index
2009-01-28
Total views
46 ( #245,855 of 2,504,843 )
Recent downloads (6 months)
1 ( #417,030 of 2,504,843 )
2009-01-28
Total views
46 ( #245,855 of 2,504,843 )
Recent downloads (6 months)
1 ( #417,030 of 2,504,843 )
How can I increase my downloads?
Downloads
