Approximation of subsets of natural numbers by c.e. sets

02/09/2019
by   Mohsen Mansouri, et al.
0

The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, Δ_2-approximation, 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 non-c.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 non-c.e. and include a maximal set inside themselves, and c.irregular sets that are non-c.e. and non-immune 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

page 1

page 2

page 3

page 4

research
09/04/2019

Finitely Supported Sets Containing Infinite Uniformly Supported Subsets

The theory of finitely supported algebraic structures represents a refor...
research
02/14/2023

Sizes of flat maximal antichains of subsets

This is the second of two papers investigating for which positive intege...
research
04/30/2019

Quantitative continuity and computable analysis in Coq

We give a number of formal proofs of theorems from the field of computab...
research
05/07/2018

Computational Complexity of Space-Bounded Real Numbers

In this work we study the space complexity of computable real numbers re...
research
10/09/2021

On sets of linear forms of maximal complexity

We present a uniform description of sets of m linear forms in n variable...
research
06/04/2021

Maximal antichains of subsets II: Constructions

This is the second in a sequence of three papers investigating the quest...
research
11/10/2020

Decision times of infinite computations

The decision time of an infinite time algorithm is the supremum of its h...

Please sign up or login with your details

Forgot password? Click here to reset