Article contents
Kolmogorov complexity and symmetric relational structures
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1998
References
REFERENCES
- 6
- Cited by