Abstract
This note provides a demonstration of the fact that any function with a suitably sparse but infinite domain may be extended to a universal algorithm in the sense of Kolmogorov. Further, it is shown that strings random in the sense of Kolmogorov are never sparsely distributed.
C.R. Categories: