| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427530 | Information Processing Letters | 2013 | 8 Pages |
We show that there are computably enumerable (c.e.) sets with maximum initial segment Kolmogorov complexity amongst all c.e. sets (with respect to both the plain and the prefix-free version of Kolmogorov complexity). These c.e. sets belong to the weak truth table degree of the halting problem, but not every weak truth table complete c.e. set has maximum initial segment Kolmogorov complexity. Moreover, every c.e. set with maximum initial segment prefix-free complexity is the disjoint union of two c.e. sets with the same property; and is also the disjoint union of two c.e. sets of lesser initial segment complexity.
► There are computably enumerable (c.e.) sets with maximum initial segment Kolmogorov complexity amongst all c.e. sets. ► These complete sets are characterized in the case of one of the measures of initial segment complexity. ► Every c.e. set can be split into two c.e. disjoint parts of the same prefix-free complexity but this fails for plain complexity.
