
Events Search and Views Navigation
November 2019
New developments on algorithmically random closed sets
Speaker: Christopher Porter (Drake University) Abstract: In this talk, I will discuss recent joint work with Adam Case on algorithmically random closed subsets of Cantor space. In earlier work, Cenzer and Weber studied the behavior of various biased random closed sets under unions and intersections, showing that these operations preserve randomness in the sense that performing such an operation on a pair of relatively random closed sets results in a closed set that is random with respect to the measure…
Find out more »