Kolmogorov complexity and symmetric relational structures

DOI10.2307/2586728zbMath0924.03050OpenAlexW1608111826MaRDI QIDQ4227881

Petrus H. Potgieter, Willem L. Fouché

Publication date: 8 November 1999

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586728

zbMATH Keywords

Kolmogorov complexityhomogeneous structuresrandom algebraic structurerandom diagramrandom layered partially ordered set

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Model theory of denumerable and separable structures (03C15)

Related Items

Characterising the Martin-Löf random sequences using computably enumerable sets of measure one, A classification of orbits admitting a unique invariant measure, Martin-Löf randomness, invariant measures and countable homogeneous structures

Cites Work

• Unnamed Item
• Unnamed Item
• Identifying randomness given by high descriptive complexity
• The average number of linear extensions of a partial order
• Descriptive Complexity and Reflective Properties of Combinatorial Configurations
• The definition of random sequences