Kolmogorov complexity and symmetric relational structures
Willem L. Fouché, Petrus H. Potgieter · Journal of Symbolic Logic · 1998
Abstract We study partitions of Fraïssé limits of classes of finite relational structures where the partitions are encoded by infinite binary strings which are random in the sense of Kolmogorov-Chaitin.