Algorithmic randomness and Ramsey properties of countable homogeneous structures

2013/08/26 by Fouché, Willem L.
#Computational Complexity (cs.CC) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1308.5506

Abstract

We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group S_∞ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with Ramsey Fraïssé order classes and algorithmic randomness.

Related

• Martin-Lof randomness, invariant measures and countable homogeneous structurs
• Algorithmic Randomness For Amenable Groups
• Reducts of the random partial order
• Permutations on the random permutation
• Amenability and Ramsey Theory