K-trivial set

A K-trivial set is a specific type of computably enumerable (c.e.) set that is closely related to algorithmic randomness and Kolmogorov complexity. More formally, a set \( A \) is defined to be K-trivial if the prefix-free Kolmogorov complexity \( K(A \cap \{0, \ldots, n\}) \) is bounded by a constant for all \( n \).