Title of article
Randomness, computability and algebraic specifications Original Research Article
Author/Authors
Bakhadyr Khoussainov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
15
From page
1
To page
15
Abstract
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.
Keywords
Kolmogorov complexity , Simple set , Residually finite algebra , Computably enumerable algebra
Journal title
Annals of Pure and Applied Logic
Serial Year
1998
Journal title
Annals of Pure and Applied Logic
Record number
896114
Link To Document