Algorithmic randomness and Ramsey properties of countable homogeneous structures [article]

Willem L. Fouché
2013 arXiv   pre-print
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.
arXiv:1308.5506v1 fatcat:xiezazy6l5grjgid35677eitbi