Algorithmic randomness and Ramsey properties of countable homogeneous structures
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 address this problem by investigating a link between the symmetries associated with Ramsey Fra\"iss\'e order classes and algorithmic randomness.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.