RANDOMNESS, COMPUTABILITY, AND ALGEBRAIC SPECIFICATIONS

Authors
KHOUSSAINOV B
Citation
B. Khoussainov, RANDOMNESS, COMPUTABILITY, AND ALGEBRAIC SPECIFICATIONS, Annals of pure and applied Logic, 91(1), 1998, pp. 1-15
Citations number
15
Categorie Soggetti
Mathematics,Mathematics,Mathematics,Mathematics
Journal title
Annals of pure and applied Logic → ACNP
ISSN journal
01680072
Volume
91
Issue
1
Year of publication
1998
Pages
1 - 15
Database
ISI
SICI code
0168-0072(1998)91:1<1:RCAAS>2.0.ZU;2-Z
Abstract
This paper shows how the notion of randomness defines, in a natural wa y, an algebra. It turns out that the algebra is computably enumerable and finitely generated. The paper investigates algebraic and effective properties of this algebra.