Kolmogorov Complexity and Symmetric Relational Structures

  title={Kolmogorov Complexity and Symmetric Relational Structures},
  author={Willem L. Fouch{\'e} and Petrus H. Potgieter},
  journal={J. Symb. Log.},
We study partitions of Fraiss6 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. ? 

Figures from this paper

Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures
  • W. Fouché
  • Mathematics, Computer Science
  • 2012
This paper investigates a link between the symmetries associated with Ramsey Fraisse order classes and algorithmic randomness and the closed amenable subgroups of the symmetric group S ∞ of a countable set.
Recursive events in random sequences
  • G. Davie
  • Mathematics, Computer Science
    Arch. Math. Log.
  • 2001
A recursive predicate P holds with computable probability for a random infinite sequence ω and is applied to the halting probability Ω and it is shown that various generalizations of the result fail.
Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures
  • W. Fouché
  • Mathematics
    Theory of Computing Systems
  • 2012
The random elements of S∞, which are permutations that transform recursively presented universal structures into such structures which are Martin-Löf random, are studied.
Machine Learning and Forecasting: A Review
The chapter considers critically the successes of machine learning in forecasting, using some case studies as well as theoretical considerations, including limitations on machine learning and other techniques for forecasting.


Descriptive Complexity and Reflective Properties of Combinatorial Configurations
We study the Ramsey theoretic properties of combinatorial configurations which are generated by infinite binary strings which are random in the sense of Kolmogorov-Chaitin. Introduction In this paper
Laws in Logic and Combinatorics
This is a survey of logical results concerning random structures. A class of relational structures on which a (finitely additive) probability measure has been defined has a 0–1 law for a particular
Identifying randomness given by high descriptive complexity
Methods for identifying random phenomena which are logical consequences of the fact that almost all real numbers are of a high descriptive complexity enable us to find complexity-theoretic versions of classical results in the theory of random series.
Asymptotic enumeration of partial orders on a finite set
By considering special cases, the number Pn of partially ordered sets on a set of n elements is shown to be (1 + O(lIn))Qn, where Qn is the number of partially ordered sets in one of the special
CONTENTS Introduction 389 1. Algorithmic Definition of Randomness: Infinite Case 390 1.1. From finite chains to infinite sequences 390 1.2. Three properties of a random sequence 391 1.3. Typical
Ramsey's Theorem and Recursion Theory
It is shown that if P is such a recursive partition of [ N ] n, then H ( P ) contains a set which is Π n 0 in the arithmetical hierarchy, and it is proved that for each n ≥ 2 there is a recursive partitions P of [N ] n into two classes such that H (P ) contains no Σ n 0 set.
The Average Number of Linear Extensions of a Partial Order
An asymptotic formula is given for (a) the average number of linear extensions of an n -element partial order and (b) the number of suborders of ann -element linear order.
Ramsey's Theorem does not Hold in Recursive Set Theory
On a Problem of Formal Logic
This paper is primarily concerned with a special case of one of the leading problems of mathematical logic, the problem of finding a regular procedure to determine the truth or falsity of any given
Algorithmic Information Theory
This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for