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 an r.e. splitting of A. The r.e. set A is tt-mitotic (btt-mitotic) if there is an 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 the existence of the tt - mitotic hypersimple set, which is not btt - mitotic is proved.
oai:noad.sci.am:135788
Institute for Informatics and Automation Problems
11th International Conference on Computer Science and Information Technologies CSIT 2017
Mar 3, 2021
Jul 16, 2020
17
https://noad.sci.am/publication/149315
Edition name | Date |
---|---|
Arsen H. Mokatsian, On the Existence of the tt-Mitotic HypersimpleSet Which is not btt-Mitotic | Mar 3, 2021 |
Mokatsian Arsen H.
Mokatsian Arsen H.