ON HYPERSIMPLE wtt -MITOTIC SETS, WHICH ARE NOT tt -MITOTIC
Arsen H. Mokatsian · 2010
A Т-complete wtt-mitotic set is composed, which is not tt-mitotic. A relation is found out between structure of computably enumerable sets and the density of their unsolvability degrees. Let us adduce some definitions: A computably enumerable (c.e.) set is tt - mitotic ( wtt - mitotic) set if it is the disjoint union of two c.e. sets both of the same tt -degree ( wtt -degree) of unsolvability. Let A be an infinite set. f majorize A if ( )) ) ( ( n z n f n ≥ ∀