𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computability, Complexity and Randomness

✍ Scribed by Rod Downey


Book ID
118780969
Publisher
Springer
Year
2012
Tongue
English
Weight
104 KB
Volume
52
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Randomness, Computability, and Density
✍ Downey, Rod G.; Hirschfeldt, Denis R.; Nies, AndrΓ© πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 203 KB
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.

Computability and complexity in analysis
✍ Vasco Brattka; Peter Hertling; Ker-I Ko; Hideki Tsuiki πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 70 KB