Computational randomness and lowness

Journal of Symbolic Logic 66 (3):1199-1205 (2001)
Abstract
We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0'. This contrasts with a result of Kučera and Terwijn [5] on sets that are low for the class of Martin-Löf random reals
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,449
External links
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
References found in this work BETA

No references found.

Citations of this work BETA
Rutger Kuyper (2013). Natural Factors of the Muchnik Lattice Capturing IPC. Annals of Pure and Applied Logic 164 (10):1025-1036.
Keng Meng Ng (2008). On Strongly Jump Traceable Reals. Annals of Pure and Applied Logic 154 (1):51-69.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

5 ( #230,794 of 1,102,628 )

Recent downloads (6 months)

3 ( #121,188 of 1,102,628 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.