A C.E. Real That Cannot Be SW-Computed by Any Ω Number

Notre Dame Journal of Formal Logic 47 (2):197-209 (2006)
Abstract
The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occurs naturally in proofs in classical computability theory as well as in the recent work of Soare, Nabutovsky, and Weinberger on applications of computability to differential geometry. We study the sw-degrees of c.e. reals and construct a c.e. real which has no random c.e. real (i.e., Ω number) sw-above it
Keywords sw reducibility   c.e. reals   randomness
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: 10,337
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
Similar books and articles
Jack Copeland (1997). The Broad Conception of Computation. American Behavioral Scientist 40 (6):690-716.
Daesuk Han (2011). Wittgenstein and the Real Numbers. History and Philosophy of Logic 31 (3):219-245.
Berit Brogaard (2011). Color Experience in Blindsight? Philosophical Psychology 24 (6):767 - 786.
Analytics

Monthly downloads

Added to index

2010-08-24

Total downloads

2 ( #330,937 of 1,096,600 )

Recent downloads (6 months)

1 ( #258,571 of 1,096,600 )

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.