Kolmogorov complexity and symmetric relational structures
Computational Complexity
2016-08-16 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.cs/0402034,
title = {Kolmogorov complexity and symmetric relational structures},
author = {W. L. Fouché and P. H. Potgieter},
journal= {arXiv preprint arXiv:cs/0402034},
year = {2016}
}
Comments
11 pages, two diagrams