Kolmogorov complexity and symmetric relational structures
<|reference_start|>Kolmogorov complexity and symmetric relational structures: We study partitions of Fra\"{\i}ss\'{e} limits of classes of finite relational structures where the partitions are encoded by infinite binary sequences which are random in the sense of Kolmogorov, Chaitin and Solomonoff. It is shown that partition by a random sequence of a Fra\"{\i}ss\'{e} limit preserves the limit property of the object.<|reference_end|>
@article{fouché2004kolmogorov,
    title={Kolmogorov complexity and symmetric relational structures},
    author={W.L. Fouch'e, P.H. Potgieter},
    journal={The Journal of Symbolic Logic, Volume 63, Number 3, September
  1998, 1083-1094},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0402034},
    primaryClass={cs.CC cs.DM}
}