Sciweavers

CORR
2010
Springer
57views Education» more  CORR 2010»
13 years 8 months ago
Slopes of Tilings
We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper th...
Emmanuel Jeandel, Pascal Vanier
APAL
1998
121views more  APAL 1998»
13 years 11 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
APAL
2006
123views more  APAL 2006»
13 years 11 months ago
The ibT degrees of computably enumerable sets are not dense
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
George Barmpalias, Andrew E. M. Lewis