Randomness, computability and algebraic specifications

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.

Identifiers

DOI

10.1016/s0168-0072(97)00040-7

Citations and references