Kolmogorov complexity and symmetric relational structures

Details Kolmogorov complexity and symmetric relational structures Kolmogorov complexity and symmetric relational structures

2004-02-16

arxiv.org/abs/cs/0402034v1

The Journal of Symbolic Logic, Volume 63, Number 3, September 1998, 1083-1094

Computer Science

Computational Complexity

11 pages, two diagrams

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Kolmogorov complexity and symmetric relational structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kolmogorov complexity and symmetric relational structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kolmogorov complexity and symmetric relational structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680432