5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.LO2015★ 5 cited
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…
math.LO2015
Algorithmically random functions and effective capacities
Douglas Cenzer, Christopher P. Porter
We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuo…
math.LO2015
The interplay of classes of algorithmically random objects
Quinn Culver, Christopher P. Porter
We study algorithmically random closed subsets of , algorithmically random continuous functions from to , and algorithmically random Borel probability measures on $…