5 citations · 5 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.LO2021
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…
math.LO2021
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…