Library Header Image
LSE Research Online LSE Library Services

A c.e. real that cannot be sw-computed by any Ω number

Barmpalias, George and Lewis-Pye, Andrew (2006) A c.e. real that cannot be sw-computed by any Ω number. Notre Dame Journal of Formal Logic, 47 (2). pp. 197-209. ISSN 0029-4527

Full text not available from this repository.
Identification Number: 10.1305/ndjfl/1153858646


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.

Item Type: Article
Official URL:
Additional Information: © 2006 University of Notre Dame
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 06 Aug 2013 11:12
Last Modified: 03 Jun 2024 03:45

Actions (login required)

View Item View Item