
Finitely Supported Sets Containing Infinite Uniformly Supported Subsets
The theory of finitely supported algebraic structures represents a refor...
read it

Quantitative continuity and computable analysis in Coq
We give a number of formal proofs of theorems from the field of computab...
read it

Computational Complexity of SpaceBounded Real Numbers
In this work we study the space complexity of computable real numbers re...
read it

On sets of linear forms of maximal complexity
We present a uniform description of sets of m linear forms in n variable...
read it

Gap Processing for Adaptive Maximal PoissonDisk Sampling
In this paper, we study the generation of maximal Poissondisk sets with...
read it

Maximal antichains of subsets II: Constructions
This is the second in a sequence of three papers investigating the quest...
read it

Decision times of infinite computations
The decision time of an infinite time algorithm is the supremum of its h...
read it
Approximation of subsets of natural numbers by c.e. sets
The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, Δ_2approximation, as well as introducing the generically computable sets have been some efforts for this purpose. In this paper, a type of approximation for natural numbers subsets by computably enumerable sets will be examined. For an infinite and nonc.e set, W_i will be an A.maximal (maximal inside A) if W_i ⊆ A, is infinite and ∀ j (W_i ⊆ W_j ⊆ A) →Δ (W_i, W_j )< ∞, where Δ is the symmetric difference of the two sets. In this study, the natural numbers subsets will be examined from the maximal subset contents point of view, and we will categorize them on this basis. We will study c.regular sets that are nonc.e. and include a maximal set inside themselves, and c.irregular sets that are nonc.e. and nonimmune sets which do not include maximal sets. Finally, we study the graph of relationship between c.e. subsets of c.irregular sets.
READ FULL TEXT
Comments
There are no comments yet.