Kolmogorov complexity and symmetric relational structures
W. L. Fouché, P. H. Potgieter
Abstract
We study partitions of Fra\"ıssé 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\"ıssé limit preserves the limit property of the object.
Create a lesson
Related papers
Marton's conjecture in polynomial time
Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal et al.
Efficient Randomized Communication Without Large Monochromatic Rectangles
Haoyu Wang, Pei Wu
On the Turing Completeness of Transformers and Agents
Yimu Qiao, Lijia Yu, Ruichen Qiu et al.
Dense Pinwheel Packing Is Strongly NP-Complete
Yusuke Kobayashi, Bingkai Lin, Joseph Swernofsky
A Separation Between Distribution-Free SQ Learning and Dimension Complexity
Shyamal Patel
Almost Optimal FPT Inapproximability for k-SetCover
Venkatesan Guruswami, Xuandi Ren