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 investigate a link between the symmetries associated with Ramsey Fraïssé order classes and algorithmic randomness.

Keywords

The research is based upon work supported by the National Research Foundation (NRF) of South Africa. Any opinion, findings and conclusions or recommendations expressed in this material are those of the author and therefore the NRF does not accept any liability in regard thereto.