Algorithmic randomness and Ramsey properties of countable homogeneous structures

From MaRDI portal



Abstract: We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group Sinfty 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.











This page was built for publication: Algorithmic randomness and Ramsey properties of countable homogeneous structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915031)