𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Randomness, computability and algebraic specifications

✍ Scribed by Bakhadyr Khoussainov

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
999 KB
Volume
91
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

On algebraic and logical specifications
On algebraic and logical specifications of classes of regular languages
✍ Bakhadyr Khoussainov πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 231 KB

The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to speciΓΏcations of these classes from algebraic, computational and logical points of view.

Occupancy problems and random algebras
Occupancy problems and random algebras
✍ Michael H. Albert; Alan M. Frieze πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 388 KB

For k randomly chosen subsets of [n] = (1, 2, . , n} we consider the probability that the Boolean algebra, distributive lattice, and meet semilattice which they generate are respectively free, or all of 2t"'. In each case we describe a threshold function for the occurrence of these events. The thres

Zeros of random hyperbolic and random al
Zeros of random hyperbolic and random algebraic polynomials
✍ P. Hannigan πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 215 KB

In this paper we find the expected number of zero crossings for a general algebraic polynomial, \(\sum_{j=1}^{n} a_{j}\left(\alpha x^{j}+\beta x^{-j}\right)\), and a general hyperbolic polynomial, \(\sum_{j=1}^{n} a_{j}(\alpha \cosh j x+\beta \sinh j x)\), where \(\alpha\) and \(\beta\) are constant