• Citations Per Year
Learn More
We study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We say that a class S of computably enumerable sets bounded i4 there is an m-incomplete computably enumerable set A such that every set in S is m-reducible to A. For example, we show that the class of e4ectively simple sets is bounded; but the(More)
The main purpose of this work is to characterize computably enumerable (c.e.) sets and generalized c.e. sets according to Kolmogorov complexity hierarchy. Given a set A, we consider A m, the initial segment of length m of the characteristic sequence of A. We show that the characteristic sequence of a 2 x-c.e. set can be random in the sense of Martin-LL of.(More)
  • 1