Kojiro Kobayashi's concept of compressibility of infinite sequences is presented. We point out here that there is a greater relationship between this concept of compressibility and the Kolmogorov complexity than we expected. In addition and with the same ideas used for comparing Kobayashi and Kolmogorov approaches, we show that two different ways of defining advice function classes coincide.