Randomness, computability and algebraic specifications
Bakhadyr Khoussainov · Annals of Pure and Applied Logic · 1998
This paper shows how the notion of randomness defines, in a natural way, an algebra. It turns out that the algebra is computably enumerable and finitely generated. The paper investigates algebraic and effective properties of this algebra.