The Kolmogorov complexity function of an infinite word \xi maps a natural
number to the complexity K(\xi|n) of the n-length prefix of \xi. We
investigate the maximally achievable complexity function if \xi is taken
from a constructively describable set of infinite words. Here we are
interested ... more >>>