Algorithmic Randomness For Amenable Groups

Adam R. Day

We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shann…