Object
Title: On the tt-Complete SetWhich is tt-Mitotic but not btt-Mitotic
Abstract:
Let us adduce some definitions: If a recursively enumerable (r.e.) set A is a disjoint union of two sets B and C, then we say that B, C is a r.e. splitting of A. A r.e. set A is tt-mitotic (btt-mitotic) if there is a r.e. splitting (B,C) of A such that the sets B and C both belong to the same tt- ( btt-) degree of unsolvability, as the set A. In this paper it is proved, that there exists a tt-complete set, which is tt-mitotic, but not btt-mitotic. Moreover, the constructed set A is, indeed, q-complete.
Identifier:
oai:noad.sci.am:135966
Language:
URL:
Additional Information:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Year:
Time period:
Conference title:
10 th International Conference on Computer Science and Information Technologies CSIT 2015
Place:
Participation type:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Conferences
Last modified:
Mar 3, 2021
In our library since:
Jul 28, 2020
Number of object content hits:
18
All available object's versions:
https://noad.sci.am/publication/149575
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Arsen Mokatsian, On the tt-Complete SetWhich is tt-Mitotic but not btt-Mitotic | Mar 3, 2021 |
