Ask a Question

Prefer a chat interface with context about you and your work?

Kolmogorov complexity and symmetric relational structures

Kolmogorov complexity and symmetric relational structures

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.