Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

APAL
2006

favoriteEmaildiscussreport

123views more APAL 2006»

The ibT degrees of computably enumerable sets are not dense

13 years 4 months ago

The ibT degrees of computably enumerable sets are not dense

Download www.barmpalias.net

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

George Barmpalias, Andrew E. M. Lewis

Real-time Traffic

APAL 2006 | Enumerable Sets | Turing |

claim paper

Related Content

» The computable Lipschitz degrees of computably enumerable sets are not dense

» Upper bounds on ideals in the computably enumerable Turing degrees

» Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees

» Computably Enumerable Sets and QuasiReducibility

» Posts Programme for the Ershov Hierarchy

» Computational processes observers and Turing incompleteness

» Randomness Computability and Density

» New Algorithms for Enumerating All Maximal Cliques

» Universality and Cellular Automata

Post Info
More Details (n/a)

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

Comments (0)