5 citations · 5 across the 6 of their papers we have counts for
8 papers · 1 filter
Randomness extraction in computability theory
Douglas Cenzer, Christopher P. Porter
In this article, we study a notion of the extraction rate of Turing functionals that translate between notions of randomness with respect to different underlying probability measur…
The intersection of algorithmically random closed sets and effective dimension
Adam Case, Christopher P. Porter
In this article, we study several aspects of the intersections of algorithmically random closed sets. First, we answer a question of Cenzer and Weber, showing that the operation of…
Key developments in algorithmic randomness
Johanna N. Y. Franklin, Christopher P. Porter
The goal of this introductory survey is to present the major developments of algorithmic randomness with an eye toward its historical development. While two highly comprehensive bo…
Effective Aspects of Bernoulli Randomness
Christopher P. Porter
In this paper, we study Bernoulli random sequences, i.e., sequences that are Martin-Löf random with respect to a Bernoulli measure for some , where we allow for th…
On the interplay between effective notions of randomness and genericity
Laurent Bienvenu, Christopher P. Porter
In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence…
Trivial measures are not so trivial
Christopher P. Porter
Although algorithmic randomness with respect to various non-uniform computable measures is well-studied, little attention has been paid to algorithmic randomness with respect to co…