![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
Bounded Randomness
We introduce some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore how these randomness notions relate to classical randomness notions and to degrees of ...
-
Chapter and Conference Paper
Numberings and Randomness
We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-Löf random left-computably enumerable reals has a Friedberg num...
-
Chapter and Conference Paper
The Strength of the Grätzer-Schmidt Theorem
The Grätzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. A lattice is algebraic if it is complete and generated by its compact ele...
-
Article
Algorithmic randomness of continuous functions
We investigate notions of randomness in the space \({{\mathcal C}(2^{\mathbb N})}\) of continuous functions on ...
-
Article
Effectively closed sets and enumerations
An effectively closed set, or \({\Pi^{0}_{1}}\) class, may viewed as the set of infinite paths through a computable t...
-
Chapter and Conference Paper
Random Closed Sets
We investigate notions of randomness in the space \({\mathcal {C}}[2^{\mathbb {N}}]\) of nonempty closed subsets of {0,1}ℕ. A pro...