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 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.
Recommendations
- Martin-Löf randomness, invariant measures and countable homogeneous structures
- Effective aspects of algorithmically random structures
- A quest for algorithmically random infinite structures. II
- A quest for algorithmically random infinite structures
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
Cited in
(7)- Martin-Löf randomness, invariant measures and countable homogeneous structures
- A classification of orbits admitting a unique invariant measure
- A quest for algorithmically random infinite structures
- Random Subgroups of Rationals
- Effective aspects of algorithmically random structures
- A quest for algorithmically random infinite structures. II
- Ramsey theory for countable binary homogeneous structures
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)