Sciweavers

7 search results - page 1 / 2
» On definable filters in computably enumerable degrees
Sort
View
APAL
2007
72views more  APAL 2007»
13 years 4 months ago
On definable filters in computably enumerable degrees
Based on a result of Nies on definability the upper semilattice of computably enumerable degrees (denoted by R), we find that in R filters generated by definable subsets are al...
Wei Wang, Decheng Ding
JSYML
2002
84views more  JSYML 2002»
13 years 4 months ago
Maximal Contiguous Degrees
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...
Peter Cholak, Rodney G. Downey, Stephen Walk
ACTA
2005
87views more  ACTA 2005»
13 years 4 months ago
Hybrid networks of evolutionary processors are computationally complete
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...
Erzsébet Csuhaj-Varjú, Carlos Mart&i...
TIP
2002
100views more  TIP 2002»
13 years 4 months ago
Topological median filters
This paper describes the definition and testing of a new type of median filter for images. The topological median filter implements some existing ideas and some new ideas on fuzzy ...
Hakan Güray Senel, Richard Alan Peters II, Be...
DM
2002
82views more  DM 2002»
13 years 4 months ago
Hilbert functions of ladder determinantal varieties
We outline the computation of an explicit formula for the Hilbert function of the ladder determinantal varieties defined by the vanishing of all minors of a fixed size of a rectang...
Sudhir R. Ghorpade