A C.E. Real That Cannot Be SW-Computed by Any Ω Number
Barmpalias, George ; Lewis, Andrew E. M.
Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, p. 197-209 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2006-04-14
Classification:  sw reducibility,  c.e. reals,  randomness,  03D80,  03D15 
@article{1153858646,
     author = {Barmpalias, George and Lewis, Andrew E. M.},
     title = {A C.E. Real That Cannot Be 
SW-Computed by Any $\Omega$ Number},
     journal = {Notre Dame J. Formal Logic},
     volume = {47},
     number = {1},
     year = {2006},
     pages = { 197-209},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1153858646}
}

Barmpalias, George; Lewis, Andrew E. M. A C.E. Real That Cannot Be 
SW-Computed by Any Ω Number. Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, pp.  197-209. http://gdmltest.u-ga.fr/item/1153858646/