In this chapter, we introduce an important class of “randomnesstheoretically weak” sets, the K-trivial sets. As we will see, this class has several natural characterizations, can be used to answer several questions in the theory of algorithmic randomness, and is also of great interest to computability theory.
KeywordsCost Function Initial Segment Computable Function Minimal Pair Computable Sequence
Unable to display preview. Download preview PDF.