Algorithmic randomness and Ramsey properties of countable homogeneous structures
Computational Complexity
2013-08-27 v1
Abstract
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with Ramsey Fra\"iss\'e order classes and algorithmic randomness.
Cite
@article{arxiv.1308.5506,
title = {Algorithmic randomness and Ramsey properties of countable homogeneous structures},
author = {Willem L. Fouché},
journal= {arXiv preprint arXiv:1308.5506},
year = {2013}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1205.0386