Randomness, computability and algebraic
β
Bakhadyr Khoussainov
π
Article
π
1998
π
Elsevier Science
π
English
β 999 KB
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.