9 citations · 18 across the 4 of their papers we have counts for
4 papers
Numberings and randomness
Katie Brodhead, Bjørn Kjos-Hanssen
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 enumera…
The Strength of the Grätzer-Schmidt Theorem
Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen +3
The Grätzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. We study the reverse mathematics of this the…
Algorithmic Randomness and Capacity of Closed Sets
Douglas Cenzer, Paul Brodhead, Ferit Toska +1
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be define…
Effective Capacity and Randomness of Closed Sets
Douglas Cenzer, Paul Brodhead
We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by…