The ibT degrees of computably enumerable sets are not dense

14 years 19 days ago

Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.

George Barmpalias, Andrew E. M. Lewis

APAL 2006 | Enumerable Sets | Turing |

claim paper

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	APAL
Authors	George Barmpalias, Andrew E. M. Lewis

Comments (0)