Title :
On the existence of the tt-mitotic Low Set, which is not btt-mitotic
Author :
Mokatsian, Arsen H.
Author_Institution :
Inst. for Inf. & Autom. Problems of NASRA Yerevan, Yerevan, Armenia
Abstract :
Let us adduce some definitions: If a computably enumerable (ce.) set A is a disjoint union of two sets B and C, then we say that B, C is a ce. splitting of A. A c.e. set A is tt-mitotic (btt-mitotic) if there is a ce. Splitting (B, Q 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-mitotic low set, which is not oft-mitotic.
Keywords :
set theory; btt-mitotic; computably enumerable set; set disjoint union; tt-mitotic low set; unsolvability degree; Conferences; Encoding; Government; Injuries; Media; Multimedia communication; Computably enumerable (ce.) set; btt-reducibility; low degree; mitotic set; tt-reducibility;
Conference_Titel :
Computer Science and Information Technologies (CSIT), 2013
Conference_Location :
Yerevan
Print_ISBN :
978-1-4799-2460-8
DOI :
10.1109/CSITechnol.2013.6710333
